Shortening proofs by quantifier introduction
In this paper, we describe an extended resolution calculus based on the introduction of new existential quantifiers. The additional rule is called Q-extension (quantifier extension). We show how polynomial refutations can be obtained by applying Q-extension, whereas usual resolution refutations are exponential. We compare our new deduction concept with FR-deduction
Unable to display preview. Download preview PDF.
- 1.M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57, 1992.Google Scholar
- 2.W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, second edition, 1987.Google Scholar
- 3.C. L. Chang and R. C. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.Google Scholar
- 4.E. Eder. Relative Complexities of First Order Calculi. Vieweg, Braunschweig, 1992.Google Scholar
- 5.U. Egly. A Generalized Factorization Rule Based on the Introduction of Skolem Terms. In H. Kaindl, editor, Österreichische Artificial Intelligence Tagung, pages 116–125, Berlin, Heidelberg, New York, 1991. Springer.Google Scholar