Knuth--bendix constraint solving is NP-complete

We show the NP-completeness of the existential theory of term algebras with the Knuth--Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth--Bendix ordering constraints.

[1]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

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

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

[4]  Jeremy Dick,et al.  Automating the Knuth Bendix ordering , 1990, Acta Informatica.

[5]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[6]  Andrei Voronkov,et al.  Knuth-Bendix Constraint Solving Is NP-Complete , 2001, ICALP.

[7]  Stephan Schulz.  System Abstract: E 0.3 , 1999, CADE.

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

[9]  Michaël Rusinowitch,et al.  The Theory of Total Unary RPO Is Decidable , 2000, Computational Logic.

[10]  Pierre Lescanne,et al.  Term Rewriting Systems and Algebra , 1984, CADE.

[11]  Jean-Pierre Jouannaud,et al.  Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable , 1991, ICALP.

[12]  Andrei Voronkov,et al.  Orienting rewrite rules with the Knuth-Bendix order , 2003, Inf. Comput..

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

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

[15]  Christoph Weidenbach.  System Description: Spass Version 1.0.0 , 1999, CADE.

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

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

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

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

[20]  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 .

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

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

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

[24]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

[26]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

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

[28]  Andrei Voronkov,et al.  The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures , 2002, FSTTCS.

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

[30]  Harald Ganzinger,et al.  Constraints and Theorem Proving , 1999, CCL.

[31]  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.

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

[33]  Thomas Hillenbrand,et al.  WALDMEISTER - High-Performance Equational Deduction , 1997, Journal of Automated Reasoning.

[34]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

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

[36]  David Detlefs,et al.  A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules , 1985, RTA.

[37]  Andrei Voronkov,et al.  Orienting equalities with the Knuth-Bendix order , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

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

[39]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[40]  Thomas Hillenbrand,et al.  A phytography of WALDMEISTER , 2002, AI Commun..

[41]  Stephan Schulz.  System Abstract: E 0.61 , 2001, IJCAR.

[42]  Paliath Narendran,et al.  On Recursive Path Ordering , 1985, Theor. Comput. Sci..

[43]  Andrei Voronkov,et al.  Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order , 2001, RTA.

[44]  Andrei Voronkov,et al.  A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

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

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