Incremental Theory Reasoning Methods for Semantic Tableaux

Theory reasoning is an important technique for increasing the efficiency of automated deduction systems. In this paper we present incremental theory reasoning, a method that improves the interaction between the foreground reasoner and the background (theory) reasoner and, thus, the efficiency of the combined system. The use of incremental theory reasoning in free variable semantic tableaux and the cost reduction that can be achieved are discussed; as an example, completion-based equality reasoning is presented, including experimental data obtained using an implementation.

[1]  Bernhard Beckert,et al.  The Tableau – Based Theorem Prover 3 T AP for Multiple – Valued Logics ∗ , 1992 .

[2]  Christian G. Fermüller,et al.  Non-elementary Speedups between Different Versions of Tableaux , 1995, TABLEAUX.

[3]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[4]  Bernhard Beckert,et al.  A Completion-Based Method for Mixed Universal and Rigid E-Unification , 1994, CADE.

[5]  Werner Nutt,et al.  Basic Narrowing Revisited , 1989, J. Symb. Comput..

[6]  U. Petermann.  How to build in an open theory into connection calculi , 1992 .

[7]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[8]  Andrei Voronkov,et al.  Simultaneous Regid E-Unification Is Undecidable , 1995, CSL.

[9]  Neil V. Murray,et al.  Theory Links: Applications to Automated Theorem Proving , 1987, J. Symb. Comput..

[10]  Bernhard Beckert,et al.  The Tableau-Based Theorem Prover 3TAP for Multi-Valued Logics , 1992, CADE.

[11]  Paliath Narendran,et al.  Theorem proving using equational matings and rigid E-unification , 1992, JACM.

[12]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[13]  Bernhard Beckert,et al.  The Tableau-based Theorem Prover 3TAP Version 4.0 , 1996, CADE.

[14]  Peter Baumgartner.  A Model Elimination Calculus with Built-in Theories , 1992, GWAI.

[15]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[16]  Eric Kogel.  Rigid E-Unification Simplified , 1995, TABLEAUX.

[17]  Bernhard Beckert,et al.  The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux , 1993, Kurt Gödel Colloquium.

[18]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.