Paramodulation with Built-in AC-Theories and Symbolic Constraints

Complete paramodulation strategies are developed for clauses with symbolic constraints and built-in associativity and commutativity (AC) properties for a subset of the function symbols. Apart from the reduced search space due to the inherited ordering and unification restrictions of the inferences (cf. Nieuwenhuis and Rubio, 1995), symbolic constraints turn out to be especially useful in the context of built-in equational theoriesE. In every inference, instead of producing as many conclusions as minimalE-unifiers of two termssandt, one single conclusion is generated with an additionalE-unification problems=tkept in its constraint. In the AC-case developed here (the most extensively studied built-in theory), the computation of the (doubly exponentially many) AC-unifiers can thus be completely avoided. These results are also applied here to more efficient strategies (sometimes decision procedures) in theories expressed by finitesaturatedsets of clauses and, in particular, to rewriting and Knuth?Bendix completion modulo AC.

[1]  Albert Rubio,et al.  Theorem Proving modulo Associativity , 1995, CSL.

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

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

[4]  Eric Domenjoud.  AC unification through order-sorted AC1 unification , 1992 .

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

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

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

[8]  Paliath Narendran,et al.  Double-exponential complexity of computing a complete set of AC-unifiers , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

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

[10]  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).

[11]  Albert Rubio,et al.  Ordering, AC-theories and symbolic constraint solving , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[12]  Michaël Rusinowitch,et al.  Automated deduction with associative-commutative operators , 1991, Applicable Algebra in Engineering, Communication and Computing.

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

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

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

[16]  C. Kirchner,et al.  Deduction with symbolic constraints , 1990 .

[17]  Albrecht Fortenbacher.  An Algebraic Approach to Unification Under Associativity and Commutativity , 1987, J. Symb. Comput..

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

[19]  F. Baader,et al.  Uniication Theory , 1999 .

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

[21]  Mark E. Stickel,et al.  A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

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

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

[24]  Evelyne Contejean,et al.  A new AC unification algorithm with an algorithm for solving systems of diophantine equations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[25]  Albert Rubio,et al.  Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)* , 1995, LICS 1995.

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

[27]  C. Kirchner.  From Unification in Combination of Equational Theories to a New AC-Unification Algorithm , 1989 .

[28]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

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

[30]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

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

[32]  Patrick Lincoln,et al.  Adventures in Associative-Commutative Unification , 1989, J. Symb. Comput..

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

[34]  François Fages.  Associative-Commutative Unification , 1987, J. Symb. Comput..