Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Descriptive Approach to Language - Theoretic Complexity
Descriptive Approach to Language - Theoretic Complexity
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
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
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Semantic characterizations of navigational XPath
ACM SIGMOD Record
LiXQuery: a formal foundation for XQuery research
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Structural characterizations of the semantics of XPath as navigation tool on a document
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using reflection for querying XML documents
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
Efficient evaluation of n-ary conjunctive queries over trees and graphs
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Deciding XPath containment with MSO
Data & Knowledge Engineering
On the expressibility of functions in XQuery fragments
Information Systems
ACM Computing Surveys (CSUR)
How big must complete XML query languages be?
Proceedings of the 12th International Conference on Database Theory
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
A logic-based approach to cache answerability for XPath queries
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
Hi-index | 0.00 |
XPath is the W3C -- standard node addressing language for XML documents. XPath is still under development and its technical aspects are intensively studied. What is missing at present is a clear characterization of the expressive power of XPath, be it either semantical or with reference to some well established existing (logical) formalism. Core XPath (the logical core of XPath 1.0 defined by Gottlob et al.) cannot express queries with conditional paths as exemplified by "do a child step, while test is true at the resulting node." In a first-order complete extension of Core XPath, such queries are expressible, We add conditional axis relations to Core XPath and show that the resulting language, called conditional XPath, is equally expressive as first-order logic when interpreted on ordered trees. Both the result, the extended XPath language, and the proof are closely related to temporal logic. Specifically, while Core XPath may be viewed as a simple temporal logic, conditional XPath extends this with (counterparts of) the since and until operators.