Logics for Unordered Trees with Data Constraints on Siblings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Logics for Unordered Trees with Data Constraints on Siblings


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 attached to sibling edges of a data tree. We show that CMso satisfiability becomes undecidable when adding data constraints between siblings that can check the equality of factors of data values. For more restricted data constraints that can only check the equality of prefixes, we show that it becomes decidable, and propose a related automaton model with good complexities. This restricted logic is relevant to applications such as checking well-formedness properties of semi-structured databases and file trees. Our decidability results are obtained by compilation of CMso to automata for unordered trees, where both are enhanced with data constraints in a novel manner.
Fichier principal
Vignette du fichier
paper_78.pdf (417.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01088761 , version 1 (28-11-2014)


  • HAL Id : hal-01088761 , version 1


Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints on Siblings. LATA : 9th International Conference on Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.175-187. ⟨hal-01088761⟩
243 View
213 Download


Gmail Facebook Twitter LinkedIn More