Frank Neven, Thomas Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3), 2006. [doi]
@article{NevenS06,
title = {On the complexity of XPath containment in the presence of disjunction, DTDs, and variables},
author = {Frank Neven and Thomas Schwentick},
year = {2006},
doi = {10.2168/LMCS-2(3:1)2006},
url = {http://dx.doi.org/10.2168/LMCS-2(3:1)2006},
tags = {XPath},
researchr = {https://researchr.org/publication/NevenS06},
cites = {0},
citedby = {0},
journal = {Logical Methods in Computer Science},
volume = {2},
number = {3},
}