Abstract
We give a decision procedure for the whole existential fragment of one-step rewriting first-order theory, in the case where rewrite systems are linear, non left-left-overlapping (i.e. without critical pairs), and non ∈-left-right-overlapping (i.e. no left-hand-side overlaps on top with the right-hand-side of the same rewrite rule1). The procedure is defined by means of tree-tuple synchronized grammars.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Solving One-step Rewriting Formulae. In 12th Workshop on Unification, Roma (Italy). U. of Roma, 1998.
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA). http://l3ux02.univ-lille3.fr/tata.
F. Jacquemard. Automates d’Arbres et R_e_ecriture de Termes. Thèse de Doctorat d’Université, Université de Paris-sud, 1996. In french.
S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. DMTCS (http://dmtcs.loria.fr/), 1:69–98, 1997.
S. Limet and P. Rety. A new result about the decidability of the existential one-step rewriting theory. Research Report RR-LIFO-98-12, LIFO, 1998.
S. Limet and P. Réty. Solving Disequations modulo some Class of Rewrite Systems. In Proc. of RTA’98, Tsukuba (Japon), vol 1379 of LNCS, pages 121–135.1998.
S. Limet and F. Saubion. A general framework for r-unification. In C. Palamidessi, H. Glaser, and K. Meinke, editors, proc of PLILP-ALP’98, volume 1490 of LNCS, pages 266–281. Springer Verlag, 1998.
J. Marcinkowski. Undecidability of the First-order Theory of One-step Right Ground Rewriting. In Proceedings 8th Conference RTA, Sitges (Spain), volume 1232 of LNCS, pages 241–253. Springer-Verlag, 1997.
J. Niehren, M. Pinkal, and P. Ruhrberg. On Equality up-to Constraints over Finite Trees, Context Unification and One-step Rewriting. In W. Mc Cune, editor, Proc. of CADE’97, Townsville (Australia), volume 1249 of LNCS, pages 34–48, 1997.
F. Seynhaeve, M. Tommasi, and R. Treinen. Grid Structures and Undecidable Constraint Theories. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 357–368. Springer-Verlag, 1997.
R. Treinen. The First-order Theory of One-step Rewriting is Undecidable. In H. Ganzinger, editor, Proceedings 7th Conference RTA, New Brunswick (USA), volume 1103 of LNCS. Springer-Verlag, 1996.
S. Vorobyov. The First-order Theory of One-step Rewriting in Linear Noetherian Systems is Undecidable. In Proceedings 8th Conference RTA, Sitges (Spain), volume 1232 of LNCS, pages 241–253. Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Limet, S., Réty, P. (1999). A New Result about the Decidability of the Existential One-Step Rewriting Theory. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-48685-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66201-3
Online ISBN: 978-3-540-48685-5
eBook Packages: Springer Book Archive