Theoretical Computer Science
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Future-Looking Logics on Data Words and Trees
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
Tree automata over infinite alphabets
Pillars of computer science
An Extension of Data Automata that Captures XPath
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
A Decidable Two-Way Logic on Data Words
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS)
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We study the satisfiability problem for XPath with data equality tests. XPath is a node selecting language for XML documents whose satisfiability problem is known to be undecidable, even for very simple fragments. However, we show that the satisfiability for XPath with the rightward, leftward and downward reflexive-transitive axes (namely following-sibling-or-self, preceding-sibling-or-self, descendant-or-self) is decidable. Our algorithm yields a complexity of 3EXPSPACE, and we also identify an expressive-equivalent normal form for the logic for which the satisfiability problem is in 2EXPSPACE. These results are in contrast with the undecidability of the satisfiability problem as soon as we replace the reflexive-transitive axes with just transitive (non-reflexive) ones.