Knuth--bendix constraint solving is NP-complete

Authors:
Konstantin Korovin;Andrei Voronkov
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;The University of Manchester, UK
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2005

Citing 22
Cited 0

A procedure for automatically proving the termination of a set of rewrite rules

Proc. of the first international conference on Rewriting techniques and applications
On recursive path ordering

Theoretical Computer Science
Decidability of the purely existential fragment of the theory of term algebras

Journal of the ACM (JACM)
Negation in logic programming

Journal of Logic Programming
Equational problems anddisunification

Journal of Symbolic Computation
Automating the Knuth Bendix ordering

Acta Informatica
Satisfiability of systems of ordinal notations with the subterm property is decidable

Proceedings of the 18th international colloquium on Automata, languages and programming
Simple LPO constraint solving methods

Information Processing Letters
The first-order theory of lexicographic path orderings is undecidable

Theoretical Computer Science
Term rewriting and all that

Term rewriting and all that
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
How to Choose Weights in the Knuth Bendix Ordering

RTA '87 Proceedings of the 2nd International Conference on Rewriting Techniques and Applications
On the Use of Constraints in Automated Deduction

Selected Papers from Constraint Programming: Basics and Trends
RPO Constraint Solving Is in NP

Proceedings of the 12th International Workshop on Computer Science Logic
Term Rewriting Systems and Algebra

Proceedings of the 7th International Conference on Automated Deduction
Ordering Constraints on Trees

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Orienting Equalities with the Knuth-Bendix Order

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Orienting rewrite rules with the Knuth--Bendix order

Information and Computation - RTA 2001
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
A phytography of WALDMEISTER

AI Communications - CASC

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.