58 search results - page 1 / 12 » Resolution Proof Systems with Weak Transformation Rules |
ISSAC
1990
Springer
13 years 8 months ago
1990
Springer
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
CSL
2002
Springer
13 years 4 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 ...
TABLEAUX
2005
Springer
13 years 10 months ago
2005
Springer
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...