60 search results - page 1 / 12 » An exponential separation between regular and general resolu... |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
FOCS
1998
IEEE
13 years 8 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
SIAMCOMP
2000
13 years 4 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...