The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
We show that the first-order theory of any Knuth-Bendix order in the case of the signatures consisting of unary function symbols and constants is decidable. Our decision procedure uses interpretation of unary terms as trees and uses decidability of the weak monadic second-order theory of binary trees. One area of applications of our result is automated deduction, since using the first-order theory of the Knuth-Bendix orders we can decide an important class of ordering constraints. umaiy uccs.
Unable to display preview. Download preview PDF.
- 1.F. Baader and T. Nipkow. Term Rewriting and and All That. Cambridge University press, Cambridge, 1998.Google Scholar
- 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.
- 6.Yuri Ershov. Problems of decidability and constructive models. Nauka, 1980. (in Russian).Google Scholar
- 7.W. Hodges. Model theory. Cambridge University Press, 1993.Google Scholar
- 8.J.-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations with the sub-term property is decidable. In Automata, Languages and Programming, 18th International Colloquium (ICALP), volume 510 of Lecture Notes in Computer Science, pages 455–468, 1991.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 15.Narendran, Rusinowitch, and Verma. RPO constraint solving is in NP. In CSL: 12thWorkshop on Computer Science Logic, volume 1584, pages 385–398. LNCS, Springer-Verlag, 1998.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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 ).Google Scholar