First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
Reeves, Marijn J
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
cs.LO 4verdicts
UNVERDICTED 4representative citing papers
A new acceleration method for array-manipulating loops uses inductive lvalues and lambdas to unify treatment with scalars and enable lemma-on-demand SMT solving.
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
New ERCL algorithm using dual implication points in CDCL SAT solvers shows performance gains over baselines on Tseitin and XORified formulas.
citing papers explorer
-
A Resolution-Based Interactive Proof System for UNSAT
First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
-
Accelerating Loops with Arrays
A new acceleration method for array-manipulating loops uses inductive lvalues and lambdas to unify treatment with scalars and enable lemma-on-demand SMT solving.
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
Extended Resolution Clause Learning via Dual Implication Points
New ERCL algorithm using dual implication points in CDCL SAT solvers shows performance gains over baselines on Tseitin and XORified formulas.