DRAT and Propagation Redundancy Proofs Without New Variables

2 Sep 2019 Sam Buss Neil Thapen

We study the complexity of a range of propositional proof systems which allow inference rules of the form: from a set of clauses Gamma derive Gamma+C where, due to some syntactic condition, Gamma+C is satisfiable if Gamma is, but where Gamma does not necessarily imply C. These inference rules include BC, RAT, SPR and PR (respectively short for blocked clauses, resolution asymmetric tautologies, subset propagation redundancy and propagation redundancy). These arose from work in satisfiability (SAT) solving... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE
  • LOGIC
  • 68T15 (PRIMARY) 03B35, 03B05 (SECONDARY)