Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic

Martin Müller
Joachim Niehren

Résumé

The system FT< of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate decidability and complexity questions for fragments of the first-order theory of FT<. It is well-known that the first-order theory of FT< is decidable and that several of its fragments can be decided in quasi-linear time, including the satisfiability problem of FT< and its entailment problem with existential quantification p |= models E x1 ... E xn p' Much less is known on the first-order theory of FT<. The satisfiability problem of FT< can be decided in cubic time, as well as its entailment problem without existential quantification. Our main result is that the entailment problem of FT< with existential quantifiers is decidable but PSPACE-hard. Our decidability proof is based on a new technique where feature constraints are expressed in second-order monadic logic with countably many successors SwS. We thereby reduce the entailment problem of FT< with existential quantification to Rabin's famous theorem on tree automata.
Fichier principal
Vignette du fichier
SWSJournal99.pdf (294.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00536814 , version 1 (16-11-2010)

Identifiants

  • HAL Id : inria-00536814 , version 1

Citer

Martin Müller, Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. 9th International Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan. pp.196--210. ⟨inria-00536814⟩
20 Consultations
97 Téléchargements

Partager

Gmail Facebook X LinkedIn More