Decidable classes of documents for XPath

Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys, Marc Herbstritt
2012 Foundations of Software Technology and Theoretical Computer Science  
We study the satisfiability problem for XPath over XML documents of bounded depth. We define two parameters, called match width and braid width, that assign a number to any class of documents. We show that for all k, satisfiability for XPath restricted to bounded depth documents with match width at most k is decidable; and that XPath is undecidable on any class of documents with unbounded braid width. We conjecture that these two parameters are equivalent, in the sense that a class of documents
more » ... has bounded match width iff it has bounded braid width.
doi:10.4230/lipics.fsttcs.2012.99 dblp:conf/fsttcs/BaranyBFP12 fatcat:c7xxinkaxbe6pldc5senl3qx3m