The decidability of the first-order theory of the Knuth-Bendix order in the case of unary signatures

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

Volumn 2556 LNCS, Issue , 2002, Pages 230-240

  Korovin, Konstantin ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTABILITY AND DECIDABILITY; SOFTWARE ENGINEERING;

AUTOMATED DEDUCTION; DECISION PROCEDURE; FIRST ORDER THEORIES; KNUTH-BENDIX ORDER; MONADIC SECOND ORDER THEORY; ORDERING CONSTRAINTS; UNARY FUNCTIONS;

DECISION THEORY;

EID: 84877761471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_21     Document Type: Conference Paper

References (21)

1. F. Baader and T. Nipkow. Term Rewriting and and All That. Cambridge University press, Cambridge, 1998.
2. H. Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387-411, 1990.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tom-masi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
4. H. Comon and R. Treinen. The first-order theory of lexicographic path orderings is undecid-able. Theoretical Computer Science, 176(1-2):67-87, 1997.
5. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
6. Yuri Ershov. Problems of decidability and constructive models. Nauka, 1980. (in Russian).
7. W. Hodges. Model theory. Cambridge University Press, 1993.
8. J.-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Automata, Languages and Programming, 18th International Colloquium (ICALP), volume 510 of Lecture Notes in Computer Science, pages 455-468, 1991.
9. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, 1970.
10. K. Korovin and A. Voronkov. A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering. In Proc. 15th Annual IEEE Symp. on Logic in Computer Science, pages 291-302, Santa Barbara, California, June 2000.
11. K. Korovin and A. Voronkov. Knuth-bendix ordering constraint solving is NP-complete. In F. Orejas, P.G. Spirakis, and J. van Leeuwen, editors, Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, volume 2076 of Lecture Notes in Computer Science, pages 979-992. Springer Verlag, 2001.
12. K. Korovin and A. Voronkov. Verifying orientability of rewrite rules using the Knuth-Bendix order. In A. Middeldorp, editor, Rewriting Techniques and Applications, 12th International Conference, RTA 2001, volume 2051 of Lecture Notes in Computer Science, pages 137-153. Springer Verlag, 2001.
13. M. Maher. Complete axiomatizations of the algebras of finite, rational and infi nite trees. In Proc. IEEE Conference on Logic in Computer Science (LICS), pages 348-357, 1988.
14. Narendran and Rusinowitch. The theory of total unary rpo is decidable. In First International Conference on Computational Logic, volume 1861 of Lecture Notes in Computer Science, pages 660-672, 2000.
15. Narendran, Rusinowitch, and Verma. RPO constraint solving isin NP. InCSL: 12thWorkshop on Computer Science Logic, volume 1584, pages 385-398. LNCS, Springer-Verlag, 1998.
16. R. Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters, 47:65-69, 1993.
17. R. Nieuwenhuis and J.M. Rivero. Solved forms for path ordering constraints. In In Proc. 10th International Conference on Rewriting Techniques and Applications (RTA), volume 1631 of Lecture Notes in Computer Science, pages 1-15, Trento, Italy, 1999.
18. Michael O. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, chapter C.3, pages 595-629. North-Holland, Amsterdam, 1977.
19. James W. Thatcherand Jesse B. Wright. Generalized finite automatatheory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.
20. Ralf Treinen. A new method for undecidability proofs of first order theories. In Foundations of Software Technology and Theoretical Computer Science, (FSTTCS), 10th conference, volume 472 of Lecture Notes in Computer Science, pages 48-62, 1990. (journal version [21]).
21. Ralf Treinen. A new method for undecidablity proofs of first order theories. Journal of Symbolic Computations, 14(5):437-458, 1992.