Tree Tuple Languages from the Logic Programming Point of View |
| |
Authors: | Sébastien Limet Gernot Salzer |
| |
Affiliation: | 1. LIFO, Department d’Informatique, Université d’Orléans, B.P. 6759, 45067, Orleans Cedex 02, France 2. Technische Universit?t Wien, Favoritenstr. 9/E1852, 1040, Wien, Austria
|
| |
Abstract: | We introduce inductive definitions over language expressions as a framework for specifying tree tuple languages. Inductive
definitions and their subclasses correspond naturally to classes of logic programs, and operations on tree tuple languages
correspond to the transformation of logic programs. We present an algorithm based on unfolding and definition introduction
that is able to deal with several classes of tuple languages in a uniform way. Termination proofs for clause classes translate
directly to closure properties of tuple languages, leading to new decidability and computability results for the latter. |
| |
Keywords: | tree tuples logic programming inductive definitions |
本文献已被 SpringerLink 等数据库收录! |
|