Decidable classes of documents for XPath

Authors Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys

Thumbnail PDF


  • Filesize: 1.59 MB
  • 13 pages

Document Identifiers

Author Details

Vince Bárány
Mikolaj Bojanczyk
Diego Figueira
Pawel Parys

Cite AsGet BibTex

Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, and Pawel Parys. Decidable classes of documents for XPath. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 99-111, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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 has bounded match width iff it has bounded braid width.
  • XPath
  • XML
  • class automata
  • data trees
  • data words
  • satisfiability


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail