34 search results - page 3 / 7 » Substitutions into propositional tautologies |
136
click to vote
CSL
2002
Springer
15 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 ...
123
click to vote
CADE
2008
Springer
15 years 7 months ago
2008
Springer
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
152
click to vote
ENGL
2007
15 years 5 months ago
2007
— The aim of the present work is to present a characterization of the Gentzen System G by means of a regulated grammar, according to the Formal Languages Theory. Given a proposit...
140
Voted
CSL
2005
Springer
15 years 11 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
115
click to vote
STACS
2010
Springer
16 years 16 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...