11 search results - page 1 / 3 » Verification of Proofs of Unsatisfiability for CNF Formulas |
DATE
2003
IEEE
13 years 10 months ago
2003
IEEE
STOC
1998
ACM
13 years 9 months ago
1998
ACM
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
DAC
2007
ACM
14 years 5 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...