91 search results - page 1 / 19 » On the Polynomial Transparency of Resolution |
IJCAI
1993
13 years 6 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
DAM
2008
13 years 4 months ago
2008
We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
MST
2010
13 years 3 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...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
ERSHOV
2001
Springer
13 years 9 months ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...