论文信息 - Knuth-Bendix Constraint Solving Is NP-Complete

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.

Andrei Voronkov | Konstantin Korovin

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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