General Connections via Equality Elimination

A new way of handling equality in the connection method is described. Our method is called equality elimination. It does not require rigid E-uni cation which is the basis of most known extension procedures. Equality elimination uses e cient ordering strategies via basic superposition and simpli cation. In addition, we present a new treatment of the connection method via named matrices which gives a number of advantages. Section

[1]  Dan Benanav.  Simultaneous Paramodulation , 1990, CADE.

[2]  Ewing L. Lusk,et al.  Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years , 1992, LPAR.

[3]  Paliath Narendran,et al.  Rigid E-Unification: NP-Completeness and Applications to Equational Matings , 1990, Inf. Comput..

[4]  Dag Prawitz,et al.  A proof procedure with matrix reduction , 1970 .

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

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

[7]  Michael Gelfond,et al.  Theory of deductive systems and its applications , 1987 .

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

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

[10]  Bernhard Beckert,et al.  An Improved Method for Adding Equality to Free Variable Semantic Tableaux , 1992, CADE.

[11]  Elmar Eder.  Consolution and its Relation with Resolution , 1991, IJCAI.

[12]  Jorge Lobo,et al.  Theory of Disjunctive Logic Programs , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[13]  Thierry Boy de la Tour.  Minimizing the Number of Clauses by Renaming , 1990, CADE.

[14]  Andrei Voronkov,et al.  Equality Elimination for the Inverse Method and Extension Procedures , 1995, IJCAI.

[15]  Peter B. Andrews.  Refutations by Matings , 1976, IEEE Transactions on Computers.

[16]  Uwe Petermann,et al.  Rigid Unification by Completion and Rigid Paramodulation , 1994, KI.

[17]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[18]  Jean H. Gallier,et al.  Extending SLD Resolution to Equational Horn Clauses using E-Unification , 1989, J. Log. Program..

[19]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition , 1991, J. Symb. Comput..

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

[21]  Andrei Voronkov,et al.  Theorem Proving in Non-Standard Logics Based on the Inverse Method , 1992, CADE.

[22]  Jean Goubault-Larrecq,et al.  A Rule-based Algorithm for Rigid E-Unification , 1993, Kurt Gödel Colloquium.

[23]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[24]  Albert Rubio,et al.  Basic Superposition is Complete , 1992, ESOP.

[25]  Wayne Snyder,et al.  Basic Paramodulation and Superposition , 1992, CADE.

[26]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[27]  Andrei Voronkov,et al.  A New Procedural Interpretation of Horn Clauses with Equality , 1995, ICLP.

[28]  Jean H. Gallier,et al.  Unification procedures in automated deduction methods based on matings: A survey , 1992, Tree Automata and Languages.