Logics for Unordered Trees with Data Constraints

Adrien Boiret 1 Vincent Hugot 1 Joachim Niehren 1 Ralf Treinen 2
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : We study counting monadic second-order logics (CMso) for unordered data trees. Our objective is to enhance this logic with data constraints for comparing string data values. Comparisons between data values at arbitrary positions of a data tree quickly lead to undecidability. Therefore, we restrict ourselves to comparing sibling data values of unordered trees. But even in this case CMso remains undecidable when allowing data comparisons that can check the equality of string factors. However, for more restricted data constraints that can only check the equality of string prefixes, it becomes decidable. This decidability result is obtained by reduction to WSkS. Furthermore, we exhibit a restricted class of constraints which can be used in transitions of tree automata, resulting in a model with tractable complexity, which can be extended with structural equality tests between siblings. This practical restriction is relevant to applications such as checking well-formedness properties of file system trees. PDF available here.
Type de document :
Article dans une revue
Journal of Computer and System Sciences (JCSS), Elsevier, 2017, pp.40
Liste complète des métadonnées

Contributeur : Inria Links <>
Soumis le : mercredi 15 juillet 2015 - 19:05:42
Dernière modification le : mardi 3 juillet 2018 - 11:22:06


  • HAL Id : hal-01176763, version 1



Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints. Journal of Computer and System Sciences (JCSS), Elsevier, 2017, pp.40. 〈hal-01176763〉



Consultations de la notice