Article thumbnail

Two-Variable Logic on Data Trees and XML Reasoning

By Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick and Luc Segoufin


Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data trees is investigated. The nodes of a data tree have a label from a finite set and a data value from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the child and the next sibling predicates and the access to data values is restricted to equality tests. From this main result, decidability of satisfiability and containment for a data-aware fragment of XPath and of the implication problem for unary key and inclusion constraints is concluded

Topics: Management, Data models, F.4.3 [Mathematical Logic and Formal Languages, Decision problems, I.7.2 [Document Preparation, Markup languages General Terms, Algorithms, Design, Languages, Theory Additional Key Words and Phrases, Integrity Constraints, DTDs, XML, Consistency, Implication Work supported by the French-German cooperation programme PROCOPE, the EU-TMR network
Year: 2012
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles