73 search results - page 1 / 15 » On the Automatizability of Polynomial Calculus |
MST
2010
13 years 4 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
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 ...
CC
2010
Springer
13 years 4 days ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
TABLEAUX
1999
Springer
13 years 10 months ago
1999
Springer
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem...
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...