xlinkit: a consistency checking and smart link generation service
ACM Transactions on Internet Technology (TOIT)
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
On the power of tree-walking automata
Information and Computation - Special issue: ICC '99
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic characterizations of navigational XPath
ACM SIGMOD Record
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
First-Order and Temporal Logics for Nested Words
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing
Axiomatizing the logical core of XPath 2.0
ICDT'07 Proceedings of the 11th international conference on Database Theory
XML subtree queries: specification and composition
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Expressive power of pebble automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Loops and overloops for tree walking automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
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
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Loops and overloops for Tree-Walking Automata
Theoretical Computer Science
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
We study FO(MTC), first-order logic with monadic transitive closure, a logical formalism in between FO and MSO on trees. We characterize the expressive power of FO(MTC) in terms of nested tree-walking automata. Using the latter, we show that FO(MTC) is strictly less expressive than MSO, solving an open problem. We also present a temporal logic on trees that is expressively complete for FO(MTC), in the form of an extension of the XML document navigation language XPath with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operator, allowing one to restrict attention to a specific subtree while evaluating a subexpression. We show that the expressive power of this XPath dialect equals that of FO(MTC) for Boolean, unary and binary queries. We also investigate the complexity of the automata model as well as the XPath dialect. We show that query evaluation be done in polynomial time (combined complexity), but that emptiness (or, satisfiability) is 2ExpTime-complete.