Satisfiability of downward XPath with data equality tests


In this work we investigate the satisfiability problem for the logic XPath(↓*, ↓,=), that includes all downward axes as well as equality and inequality tests. We address this problem in the absence of DTDs and the sibling axis. We prove that this fragment is decidable, and we nail down its complexity, showing the problem to be ExpTime-complete… (More)
DOI: 10.1145/1559795.1559827


4 Figures and Tables


Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Figueira2009SatisfiabilityOD, title={Satisfiability of downward XPath with data equality tests}, author={Diego Figueira}, booktitle={PODS}, year={2009} }