Add to ORKGIn this paper, the relative eciency of two propositional systems is studied: resolution and cut-free LK in DAG. We give an upper bound for translation of resolution refutation to cut-free LK proofs. The best upper bound known was 2 n and we improve it to n 2+3 log n
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolutionrefuta...
We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower ...
AbstractResolution and cut-free LK are the most popular propositional systems used for logical autom...
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the re...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses whi...
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses whi...
AbstractA new cut-elimination method for Gentzen’s LK is defined. First cut-elimination is generaliz...
Originating from work in operations research the cutting plane refutation system CP is an extension ...
The cutting plane refutation system CP for propositional logic is an extension of resolution and is ...
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 ...
AbstractThe cutting plane refutation system CP for propositional logic is an extension of resolution...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolutionrefuta...
We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower ...
AbstractResolution and cut-free LK are the most popular propositional systems used for logical autom...
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the re...
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in diff...
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses whi...
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses whi...
AbstractA new cut-elimination method for Gentzen’s LK is defined. First cut-elimination is generaliz...
Originating from work in operations research the cutting plane refutation system CP is an extension ...
The cutting plane refutation system CP for propositional logic is an extension of resolution and is ...
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 ...
AbstractThe cutting plane refutation system CP for propositional logic is an extension of resolution...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolutionrefuta...
We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower ...