Manipulating tree tuple languages by transforming logic programs - Université d'Orléans Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Computer Science Année : 2003

Manipulating tree tuple languages by transforming logic programs

Gernot Salzer
  • Fonction : Auteur
  • PersonId : 834320

Résumé

We introduce inductive definitions over language expressions as a framework for specifying tree tuple languages. Inductive definitions and their sub-classes 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.
Fichier non déposé

Dates et versions

hal-00085313 , version 1 (12-07-2006)

Identifiants

  • HAL Id : hal-00085313 , version 1

Citer

Sébastien Limet, Gernot Salzer. Manipulating tree tuple languages by transforming logic programs. Electronic Notes in Computer Science, 2003, 86, 15 p. ⟨hal-00085313⟩
39 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More