Computer-Oriented Calculi of Sequent Trees

The problem of construction of a computer-oriented technique for inference search based on a certain sequent formalism for first-order classical logic with equality is solved. For this, special calculi of so-called sequent trees are constructed. The following features are inherent to the tree calculi: (i) preliminary skolemization is used for increasing their proof search efficiency with the help of a technique for finding the most general simultaneous unifier, (ii) every calculus is completely induced by a correspondent sequent calculus, (iii) any transformation of a sequent tree is defined by an appropriate (propositional) rule, and what’s more, (iv) certain kinds of the paramodulation rule are added to the sequent tree calculi. For all the calculi, some results about their soundness and completeness are given. Note that an approach under consideration can give a possibility to incorporate the proposed paramodulution technique into, for example, different modifications of the model elimination method, of goal-oriented sequent calculi, and of the tableaux method.

[1]  Wayne Snyder,et al.  Goal Directed Strategies for Paramodulation , 1991, RTA.

[2]  Stig Kanger,et al.  A Simplified Proof Method for Elementary Logic , 1959 .

[3]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

[4]  Alexander V. Lyaletski,et al.  Evidence Algorithm and Sequent Logical Inference Search , 1999, LPAR.

[5]  Jacques Herbrand.  Recherches sur la théorie de la démonstration , 1930 .

[6]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[7]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[8]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[9]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[10]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

[11]  D. Loveland.  A Linear Format for Resolution , 1970 .

[12]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

[13]  Reinhold Letz,et al.  Model Elimination and Connection Tableau Procedures , 2001, Handbook of Automated Reasoning.

[14]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[15]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[16]  Reiner Hähnle,et al.  Tableaux and Related Methods , 2001, Handbook of Automated Reasoning.

[17]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .