Theorem Proving modulo Associativity

We present an inference system for first-order constrained clauses with equality modulo associativity (A). Our procedure is refutationally complete and reduces to Knuth-Bendix completion modulo A in the equational case. As an essential ingredient we present the first—as far as we know-A-compatible reduction ordering total on the ground A-congruence classes.

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

[2]  Jean-Pierre Jouannaud,et al.  Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types , 1983, CAAP.

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

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

[5]  Esther König,et al.  A Hypothetical Reasoning Algorithm for Linguistic Analysis , 1994, J. Log. Comput..

[6]  L. Bachmair.  Canonical Equational Proofs , 1991, Progress in Theoretical Computer Science.

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

[8]  Nachum Dershowitz,et al.  Completion for Rewriting Modulo a Congruence , 1987, Theor. Comput. Sci..

[9]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[10]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

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

[12]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[13]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  Albert Rubio,et al.  A Total AC-Compatible Ordering Based on RPO , 1995, Theor. Comput. Sci..

[15]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[16]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[17]  Michaël Rusinowitch,et al.  Any Gound Associative-Commutative Theory Has a Finite Canonical System , 1991, RTA.

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