Location of Repository

Two-Variable Logic on Data Trees and XML Reasoning (Extended Abstract)

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

Abstract

Motivated by reasoning tasks in the context of 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 dataaware fragment of XPath and of the implication problem for unary key and inclusion constraints is concluded

Topics: data trees, decidability
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.189.3140
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.liafa.jussieu.fr/%7... (external link)
  • Suggested articles


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