Add to ORKGA pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in which no variable is used as a resolution variable twice on any branch. The problem of determining whether a given dag-like resolution proof is a valid pool resolution proof is shown to be NP-complete
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. W...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...
Abstract. Pool Resolution for propositional CNF formulas is intro-duced. Its relationship to state-o...
AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution re...
We show that the problem of finding a Resolution refutation that is at most polynomially longer than...
AbstractAgrawal and Biswas (1992) define a notion stronger than NP-completeness. With every language...
AbstractLet R be a resolution refutation, given as a sequence of clauses without explicit descriptio...
The Stone tautologies are known to have polynomial size resolutionrefutations and require exponentia...
We show that it is NP-hard to distinguish formulas that have Resolution refutations of almost linear...
It is well-known that Resolution proofs can be efficiently simulated by Sherali– Adams (SA) proofs. ...
'Algorithms and Computation' 10th International Symposium, ISAAC’99 Chennai, India, December 16–18, ...
DPLL and resolution are two popular methods for solving the problem of propositional satisfiability....
Resolution refinements called w-resolution trees with lemmas (WRTL) and withinput lemmas (WRTI) are ...
In this contribution we present a variant of a resolution theorem prover which selects resolution s...
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. W...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...
Abstract. Pool Resolution for propositional CNF formulas is intro-duced. Its relationship to state-o...
AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution re...
We show that the problem of finding a Resolution refutation that is at most polynomially longer than...
AbstractAgrawal and Biswas (1992) define a notion stronger than NP-completeness. With every language...
AbstractLet R be a resolution refutation, given as a sequence of clauses without explicit descriptio...
The Stone tautologies are known to have polynomial size resolutionrefutations and require exponentia...
We show that it is NP-hard to distinguish formulas that have Resolution refutations of almost linear...
It is well-known that Resolution proofs can be efficiently simulated by Sherali– Adams (SA) proofs. ...
'Algorithms and Computation' 10th International Symposium, ISAAC’99 Chennai, India, December 16–18, ...
DPLL and resolution are two popular methods for solving the problem of propositional satisfiability....
Resolution refinements called w-resolution trees with lemmas (WRTL) and withinput lemmas (WRTI) are ...
In this contribution we present a variant of a resolution theorem prover which selects resolution s...
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. W...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...