11 search results - page 2 / 3 » Verification of Proofs of Unsatisfiability for CNF Formulas |
141
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
130
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
We use the notion of boundary points to study resolution proofs. Given a CNF formula F, a lit(x)-boundary point is a complete assignment falsifying only clauses of F having the sam...
132
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
122
click to vote
AAAI
2006
15 years 5 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
138
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...