AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution refutation admits a tree structure. This paper shows the NP-completeness of both the resolution tree problem and a natural generalization of the resolution tree problem that does not involve resolution
We show a new connection between the space measure in tree-like resolution and the reversible pebble...
Thesis (Ph. D.)--University of Washington, 2005.This thesis explores algorithmic applications of pro...
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are n...
AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution re...
AbstractLet R be a resolution refutation, given as a sequence of clauses without explicit descriptio...
It is shown that any sequence psi_n of tautologies which expresses thevalidity of a fixed combinato...
We show that the problem of finding a Resolution refutation that is at most polynomially longer than...
AbstractResolution and cut-free LK are the most popular propositional systems used for logical autom...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...
AbstractAgrawal and Biswas (1992) define a notion stronger than NP-completeness. With every language...
A pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in ...
AbstractWe consider the parameterized problems of whether a given set of clauses can be refuted with...
AbstractStarting from the intuition given by Wu's algorithm for the resolution of polynomial systems...
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the re...
AbstractAn N-resolution proof is a resolution proof in which the resolution rule is restricted: one ...
We show a new connection between the space measure in tree-like resolution and the reversible pebble...
Thesis (Ph. D.)--University of Washington, 2005.This thesis explores algorithmic applications of pro...
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are n...
AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution re...
AbstractLet R be a resolution refutation, given as a sequence of clauses without explicit descriptio...
It is shown that any sequence psi_n of tautologies which expresses thevalidity of a fixed combinato...
We show that the problem of finding a Resolution refutation that is at most polynomially longer than...
AbstractResolution and cut-free LK are the most popular propositional systems used for logical autom...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...
AbstractAgrawal and Biswas (1992) define a notion stronger than NP-completeness. With every language...
A pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in ...
AbstractWe consider the parameterized problems of whether a given set of clauses can be refuted with...
AbstractStarting from the intuition given by Wu's algorithm for the resolution of polynomial systems...
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the re...
AbstractAn N-resolution proof is a resolution proof in which the resolution rule is restricted: one ...
We show a new connection between the space measure in tree-like resolution and the reversible pebble...
Thesis (Ph. D.)--University of Washington, 2005.This thesis explores algorithmic applications of pro...
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are n...
DOI
Add to ORKG