Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NPcomplete. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 979-- Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Using Inequalities as Term Ordering Constraints - Hurd (2003) (2 citations) (Correct)
....of a set of ordering constraints. Two term orderings commonly implemented in automated reasoning procedures are the lexicographic path ordering and the Knuth Bendix ordering [3] For both orderings, deciding the satisfiability of a set of ordering constraints is an NP complete problem [5, 4]. In this paper, we show how a Knuth Bendix ordering constraint may be approximated by a linear equality, in such a way that a set of ordering constraints is inconsistent whenever the corresponding system of linear inequalities is inconsistent. Therefore, we can safely block inferences that would ....
Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NPcomplete. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Automata, Languages and Programming, volume 2076.
Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (2004) (Correct)
No context found.
Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NPcomplete. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 979--
Decision Procedures for Recursive Data Structures with.. - Zhang, Sipma, Manna (2004) (1 citation) (Correct)
No context found.
Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NP-complete. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 979-992. Springer, 2001.
Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (Correct)
No context found.
Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NPcomplete. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 979--
Decision Procedures for Recursive Data Structures with.. - Zhang, Sipma, Manna (2004) (1 citation) (Correct)
No context found.
Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NP-complete. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 979-992. Springer, 2001.
The complete list of RTA open problems - Date April Summary (Correct)
No context found.
Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NP-complete. In Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen, editors, 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science, pages 979-992, Crete, Greece, July 2001. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC