52 search results - page 1 / 11 » On the Automatizability of Resolution and Related Propositio... |
CSL
2002
Springer
13 years 5 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
STACS
2010
Springer
14 years 6 days ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
SIAMCOMP
2000
13 years 5 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...