A Modal Perspective on Path Constraints

Natasha Alechina (1) , Stéphane Demri (2, 3) , Maarten de Rijke (4)

1 university of Notthingam
2 LSV - Laboratoire Spécification et Vérification
3 CNRS - Centre National de la Recherche Scientifique
4 UvA - University of Amsterdam [Amsterdam] = Universiteit van Amsterdam

We analyze several classes of path constraints for semistructured data and prove a umber of decidability and complexity results for such constraints. While some of these decidability results were known before, we believe that our improved complexity bounds are new. Our proofs are based on techniques from modal logic and automata theory. We believe that our modal logic perspective sheds additional light on the reasons for previously known decidability and complexity results.

Mots clés: semistructured data; path constraints; modal logic; automata theory

Domaines: Informatique [cs]; Logique en informatique [cs.LO]

Natasha Alechina, Stéphane Demri, Maarten de Rijke. A Modal Perspective on Path Constraints. Journal of Logic and Computation, 2003, 13 (6), pp.939-956. ⟨10.1093/logcom/13.6.939⟩. ⟨hal-03189647⟩