Logics for Unordered Trees with Data Constraints

Adrien Boiret 1 Vincent Hugot 2 Joachim Niehren 1 Ralf Treinen 3
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
2 SDS - Sécurité des Données et des Systèmes
LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01176763
Contributor : Inria Links <>
Submitted on : Wednesday, December 19, 2018 - 8:26:46 PM
Last modification on : Thursday, April 4, 2019 - 1:14:26 AM
Document(s) archivé(s) le : Thursday, March 21, 2019 - 1:51:41 AM

File

0.pdf
Files produced by the author(s)

Identifiers

Citation

Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints. Journal of Computer and System Sciences, Elsevier, 2019, pp.40. ⟨10.1016/j.jcss.2018.11.004⟩. ⟨hal-01176763v2⟩

Share

Metrics

Record views

119

Files downloads

218