Associative-Commutative Superposition

We present an associative-commutative paramodulation calculus that generalizes the associative-commutative completion procedure to first-order clauses. The calculus is parametrized by a selection function (on negative literals) and a well-founded ordering on terms. It is compatible with an abstract notion of redundancy that covers such simplification techniques as tautology deletion, subsumption, and simplification by (associative-commutative) rewriting. The proof of refutational completeness of the calculus is comparatively simple, and the techniques employed may be of independent interest.

[1]  Harald Ganzinger,et al.  Theorem Proving for Hierarchic First-Order Theories , 1992, ALP.

[2]  Harald Ganzinger,et al.  Rewrite techniques for transitive relations , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[3]  Michaël Rusinowitch,et al.  Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.

[4]  Ralph W. Wilkerson,et al.  Complete Sets of Reductions Modulo Associativity, Commutativity and Identity , 1989, RTA.

[5]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[6]  Ulrich Wertz,et al.  First-order theorem proving modulo equations , 1992 .

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

[8]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  Albert Rubio,et al.  A Precedence-Based Total AC-Compatible Ordering , 1993, RTA.

[10]  Jean-Pierre Jouannaud,et al.  Termination and Completion Modulo Associativity, Commutativity and Identity , 1992, Theor. Comput. Sci..

[11]  Gerald E. Peterson,et al.  Using Forcing to Prove Completeness of Resolution and Paramodulation , 1991, J. Symb. Comput..

[12]  Albert Rubio,et al.  AC-Superposition with Constraints: No AC-Unifiers Needed , 1994, CADE.

[13]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules , 1988, FGCS.

[14]  Laurent Vigneron,et al.  Associative-Commutative Deduction with Constraints , 1994, CADE.

[15]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

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

[17]  Michaël Rusinowitch,et al.  On Word Problems in Equational Theories , 1987, ICALP.

[18]  E. Paul,et al.  A General Refutational Completeness Result for an Inference Procedure Based on Associative-Commutative Unification , 1992, J. Symb. Comput..

[19]  D. Kapur,et al.  Reduction, superposition and induction: automated reasoning in an equational logic , 1988 .

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

[21]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.