A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering

The authors show the decidability of the existential theory of term algebras with any Knuth-Bendix ordering. They achieve this by giving a procedure for solving Knuth-Bendix ordering constraints. As for complexity, NP-hardness of the set of satisfiable quantifier-free formulas can be shown in the same way as by R. Nieuwenhuis (1993). The algorithm presented does not give an NP upper bound; we point out parts of our algorithm that may cause nonpolynomial behavior.

[1]  Michael J. Maher.  Complete axiomatizations of the algebras of finite, rational and infinite trees , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[2]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[3]  Jaime G. Carbonell,et al.  Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.

[4]  Hubert Comon-Lundh,et al.  Solving Symbolic Ordering Constraints , 1990, Int. J. Found. Comput. Sci..

[5]  Robert Nieuwenhuis.  Rewrite-based deduction and symbolic constraints , 1999 .

[6]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[7]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[8]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9]  Ralf Treinen,et al.  Ordering Constraints on Trees , 1994, CAAP.

[10]  Robert Nieuwenhuis.  Invited Talk: Rewrite-based Deduction and Symbolic Constraints , 1999, CADE.

[11]  Robert Nieuwenhuis,et al.  Solved Forms for Path Ordering Constraints , 1999, RTA.

[12]  K. N. Venkataraman,et al.  Decidability of the purely existential fragment of the theory of term algebras , 1987, JACM.

[13]  Hélène Kirchner,et al.  On the Use of Constraints in Automated Deduction , 1994, Constraint Programming.

[14]  H. Comon.  SOLVING SYMBOLIC ORDERING CONSTRAINTS , 1990 .

[15]  Wilfrid Hodges,et al.  Model Theory: The existential case , 1993 .

[16]  Ralf Treinen,et al.  The First-Order Theory of Lexicographic Path Orderings is Undecidable , 1997, Theor. Comput. Sci..

[17]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

[18]  Robert Nieuwenhuis,et al.  Simple LPO Constraint Solving Methods , 1993, Inf. Process. Lett..

[19]  Sophie Tison.  Trees in Algebra and Programming — CAAP'94 , 1994, Lecture Notes in Computer Science.

[20]  Michaël Rusinowitch,et al.  RPO Constraint Solving Is in NP , 1998, CSL.

[21]  Christoph Weidenbach,et al.  Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.

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

[23]  Ursula Martin,et al.  How to Choose Weights in the Knuth Bendix Ordering , 1987, RTA.

[24]  Ingo Lepper,et al.  Derivation lengths and order types of Knuth-Bendix orders , 2001, Theor. Comput. Sci..

[25]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .