The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Query automata over finite trees
Theoretical Computer Science
A Query Language Based on the Ambient Logic
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Monadic Second Order Logic and Node Relations on Graphs and Trees
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Handbook of automated reasoning
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
CTL Model Checking for Processing Simple XPath Queries
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Temporal Logics over Unranked Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Processing queries on tree-structured data efficiently
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
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Polynomial time fragments of XPath with variables
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL* and XPath navigation, and between the μ-calculus and navigation based on regular expressions. This opened up the possibility of bringing model-checking techniques into the field of XML, as documents are naturally represented as labeled transition systems. Most known results of this kind, however, are limited to Boolean or unary queries, which are not always sufficient for complex querying tasks. Here we present a technique for combining temporal logics to capture n-ary XML queries expressible in two yardstick languages: FO and MSO. We show that by adding simple terms to the language, and combining a temporal logic for words together with a temporal logic for unary tree queries, one obtains logics that select arbitrary tuples of elements, and can thus be used as building blocks in complex query languages. We present general results on the expressiveness of such temporal logics, study their model-checking properties, and relate them to some common XML querying tasks.