Logics for Unordered Trees with Data Constraints
Document type :
Article dans une revue scientifique: Article original
Title :
Logics for Unordered Trees with Data Constraints
Author(s) :
Boiret, Adrien [Auteur]
Linking Dynamic Data [LINKS]
Hugot, Vincent [Auteur]
Sécurité des Données et des Systèmes [SDS]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS]
Treinen, Ralf [Auteur]
Preuves, Programmes et Systèmes [PPS]
Linking Dynamic Data [LINKS]
Hugot, Vincent [Auteur]
Sécurité des Données et des Systèmes [SDS]
Niehren, Joachim [Auteur]

Linking Dynamic Data [LINKS]
Treinen, Ralf [Auteur]
Preuves, Programmes et Systèmes [PPS]
Journal title :
Journal of Computer and System Sciences
Pages :
40
Publisher :
Elsevier
Publication date :
2019-01-30
ISSN :
0022-0000
English keyword(s) :
data trees
Counting Mso
string comparisons
logics
Counting Mso
string comparisons
logics
HAL domain(s) :
Informatique [cs]/Théorie et langage formel [cs.FL]
Informatique [cs]/Logique en informatique [cs.LO]
Informatique [cs]/Logique en informatique [cs.LO]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
ANR Project :
Collections :
Source :
Files
- https://hal.inria.fr/hal-01176763v2/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01176763v2/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01176763v2/document
- Open access
- Access the document
- document
- Open access
- Access the document
- 0.pdf
- Open access
- Access the document