The First-Order Theory of Ordering Constraints over Feature Trees

Abstract : 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 the first-order theory of FT< and its fragments in detail, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT< is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We show that the entailment problem of FT< with existential quantification is PSPACE-complete. So far, this problem has been shown decidable, coNP-hard in case of finite trees, PSPACE-hard in case of arbitrary trees, and cubic time when restricted to quantifier-free entailment judgments. To show PSPACE-completeness, we show that the entailment problem of FT< with existential quantification is equivalent to the inclusion problem of non-deterministic finite automata. Available at http://www.ps.uni-saarland.de/Publications/documents/FTSubTheory_98.pdf
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.193-234
Liste complète des métadonnées

Littérature citée [37 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00536800
Contributeur : Joachim Niehren <>
Soumis le : mercredi 11 juin 2014 - 16:46:12
Dernière modification le : mardi 24 avril 2018 - 13:55:39
Document(s) archivé(s) le : jeudi 11 septembre 2014 - 10:41:28

Fichier

144-411-1-PB.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : inria-00536800, version 1

Collections

Citation

Martin Müller, Joachim Niehren, Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.193-234. 〈inria-00536800〉

Partager

Métriques

Consultations de la notice

153

Téléchargements de fichiers

169