The decidability of the first-order theory of Knuth-Bendix order

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3632 LNAI, Issue , 2005, Pages 131-148

  Zhang, Ting ^a   Sipma, Henny B ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY;

KNUTH-BENDIX ORDERING (KBO); RECURSIVE PATH ORDERING (RPO);

THEOREM PROVING;

EID: 26944435539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_10     Document Type: Conference Paper

References (31)

1. Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, Cambridge, UK, 1999.
2. Rolf Backofen. A complete axiomatization of a theory with feature and arity constraints. Journal of Logical Programming, 24(1&2):37-71, 1995.
3. Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387-411, 1990.
4. Hubert Comon and Catherine Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167-216, 1994.
5. Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371-425, 1989.
6. Hubert Comon and Ralf Treinen. Ordering constraints on trees. In Proceedings of the 19th International Colloquium on Trees in Algebra and Programming (CAAP'94), volume 787 of Lecture Notes in Computer Science, pages 1-14, Edinburgh, U.K., Apr 1994. Springer-Verlag.
7. Hubert Comon and Ralf Treinen. The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science, 176(1-2):67-87, 1997.
8. D. C. Cooper. Theorem proving in arithmetic without multiplication. In Machine Intelligence, volume 7, pages 91-99. American Elsevier, 1972.
9. Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 7:279-301, 1982.
10. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 2001.
11. Wilfrid Hodges. Model Theory. Cambridge University Press, Cambridge, UK, 1993.
12. Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordinal notation with the subterm property is decidable. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91), volume 510 of Lecture Notes in Computer Science, pages 455-468. Springer-Verlag, 1991.
13. Donald E. Knuth and Peter Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, 1970.
14. Reprinted in Automation of Reasoning, Vol. 2 Jurgen Siekmann and G. Wrightson, editors, pp. 342-376, Springer-Verlag, 1983.
15. Konstantin Korovin and Andrei Voronkov. A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering. In Proceedings of the 15th IEEE Symposium on Logic in Computer Science (LICS'00), pages 291-302, IEEE Computer Society Press, 2000.
16. Konstantin Korovin and Andrei Voronkov. Knuth-Bendix constraint solving is NP-complete. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP'01), volume 2076 of Lecture Notes in Computer Science, pages 979-992. Springer-Verlag, 2001.
17. Konstantin Korovin and Andrei Voronkov. The decidability of the first-order theory of the Knuth-Bendix order in the case of unary signatures. In Proceedings of the 22th Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS'02), volume 2556 of Lecture Notes in Computer Science, pages 230-240. Springer-Verlag, 2002.
18. Viktor Kuncak and Martin Rinard. On the theory of structural subtyping. Technical Report MIT-LCS-TR-879, Massachusetts Institute of Technology, January 2003.
19. Viktor Kuncak and Martin Rinard. The structural subtyping of non-recursive types is decidable. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS'03), pages 96-107. IEEE Computer Society Press, 2003.
20. M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite tree. In Proceedings of the 3th IEEE Symposium on Logic in Computer Science (LICS'88), pages 348-357. IEEE Computer Society Press, 1988.
21. A. I. Mal'cev. Axiomatizable classes of locally free algebras of various types. In The Metamathematics of Algebraic Systems, Collected Papers, chapter 23, pages 262-281. North Holland, 1971.
22. Paliath Narendran and Michael Rusinowitch. The theory of total unary RPO is decidable. In Proceedings of the 1st International Conference on Computational Logic < CL 2000), volume 1861 of Lecture Notes in Artificial Intelligence, pages 660-672. Springer-Verlag, 2000.
23. Paliath Narendran, Michael Rusinowitch, and Rakesh M. Verma. RPO constraint solving is in NP. In Proceedings of the 12th International Workshop on Computer Science Logic (CSL'98), volume 1584 of Lecture Notes in Computer Science, pages 385-398. Springer-Verlag, 1999.
24. Robert Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters, 47(2):65-69, 1993.
25. Robert Nieuwenhuis and J. Rivero. Solved forms for pnth ordering constraints. In Proceedings of 10th International Conference on Rewriting Techniques and Applications (RTA'99), volume 1631 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 1999.
26. Robert Nieuwenhuis and Albert Rubio. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation, 19(4):321-351, 1995.
27. C. R. Reddy and D. W. Loveland. Presburger arithmetic with bounded quantifier alternation. In Proceedings of the 10th Annual Symposium on Theory of Computing, pages 320-325. ACM Press, 1978.
28. Tatiana Rybina and Andrei Voronkov. A decision procedure for term algebras with queues. ACM Transactions on Computational Logic, 2(2):155-181, 2001.
29. Ralf Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14:437-457, 1992.
30. Ting Zhang, Henny Sipma, and Zohar Manna. Decision procedures for recursive data structures with integer constraints. In Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR'04), volume 3097 of Lecture Notes in Computer Science, pages 152-167. Springer-Verlag, 2004.
31. Ting Zhang, Henny Sipma, and Zohar Manna. Term algebras with length function and bounded quantifier alternation. In Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'04), volume 3223 of Lecture Notes in Computer Science, pages 321-336. Springer-Verlag, 2004.