Journal of Computer and System Sciences
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
Satisfiability of simple xpath fragments in the presence of dtds
Proceedings of the eleventh international workshop on Web information and data management
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
XML with incomplete information
Journal of the ACM (JACM)
Extending the tractability results on XPath satisfiability with sibling axes
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
On the equivalence of distributed systems with queries and communication
Proceedings of the 14th International Conference on Database Theory
On the complexity of tree pattern containment with arithmetic comparisons
Information Processing Letters
Satisfiability of simple Xpath fragments under fixed DTDs
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
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)
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
On the equivalence of distributed systems with queries and communication
Journal of Computer and System Sciences
Reasoning about pattern-based XML queries
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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. The result also holds when path expressions allow closure under the Kleene star operator. To obtain these results, we introduce a new automaton model over data trees that captures XPath(↓*, ↓,=) and has an ExpTime emptiness problem. Furthermore, we give the exact complexity of several downward-looking fragments.