Abstract
We propose an extension of tree automata, called N-automata, which captures some of the features of term schematisation languages, for instance the use of counter variables and parameters. We show that the satisfiability problem is decidable for positive, purely existential, membership formulae which permits to include the proposed formalism into most existing symbolic computation procedures (such as SLD-resolution).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Chabin, J. Chen, and P. Réty. Synchronized-context free tree-tuple languages. Technical Report RR-2006-13, LIFO, 4 rue Léonard de Vinci, BP 6759, F-45067 Orléans Cedex 2 FRANCE, 2006.
H. Chen and J. Hsiang. Logic programming with recurrence domains. In Automata, Languages and Programming (ICALP’91), pages 20–34. Springer, LNCS 510, 1991.
H. Comon. On unification of terms with integer exponents. Mathitatical Systit Theory, 28:67–88, 1995.
H. Comon, M. Dauchet, R. Gilleron, F. Jacquitard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
H. Comon and C. Delor. Equational formulae with mitbership constraints. Information and Computation, 112(2):167–216, August 1994.
H. Comon and P. Lescanne. Equational problits and disunification. Journal of Symbolic Computation, 7:371–475, 1989.
G. Feuillade, T. Genet, and V. Viet Triit Tong. Reachability Analysis over Term Rewriting Systits. J. Automated Reasoning, 33 (3-4):341–383, 2004.
M. Hermann and R. Galbavý. Unification of Infinite Sets of Terms schitatized by Primal Grammars. Theoretical Computer Science, 176(1–2):111–158, 1997.
S. Limet and G. Salzer. Manipulating tree tuple languages by transforming logic programs. Electr. Notes Theor. Comput. Sci., 86(1), 2003.
S. Limet and G. Salzer. Proving properties of term rewrite systits via logic programs. In RTA, volume 3091 of Lecture Notes in Computer Science, pages 170–184. Springer, 2004.
C. Löding. Model-checking infinite systits generated by ground tree rewriting. In M. Nielsen and U. Engberg, editors, Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002., volume 2303 of Lecture Notes in Computer Science, pages 280–294. Springer, 2002.
D. Lugiez and J. L. Moysset. Tree automata help one to solve equational formulae in AC-theories. Journal of Symbolic Computation, 18(4):297–318, 1994.
P. Réty and J. Vuotto. Tree automata for rewrite strategies. J. Symb. Comput., 40(1):749–794, 2005.
G. Salzer. The unification of infinite sets of terms and its applications. In Logic Programming and Automated Reasoning (LPAR’92), pages 409–429. Springer, LNAI 624, July 1992.
K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebras. J. ACM, 34(2):492–510, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Peltier, N. (2008). A Unified View of Tree Automata and Term Schematisations. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_33
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)