Languages, automata, and logic
Handbook of formal languages, vol. 3
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reachability and connectivity queries in constraint databases
Journal of Computer and System Sciences - Special issue on PODS 2000
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Reasoning on regular path queries
ACM SIGMOD Record
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Survey of graph database models
ACM Computing Surveys (CSUR)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Bounded Semantics of CTL and SAT-Based Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automata vs. logics on data words
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Proceedings of the 21st international conference on World Wide Web
Query languages for graph databases
ACM SIGMOD Record
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Definability problems for graph query languages
Proceedings of the 16th International Conference on Database Theory
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |
Motivated by the current interest in languages for expressing path queries to graph databases, this paper proposes to investigate Walk Logic (WL): the extension of first-order logic on finite graphs with the possibility to explicitly quantify over walks. WL can serve as a unifying framework for path query languages. To support this claim, WL is compared in expressive power with various established query languages for graphs, such as first-order logic extended with reachability; the monadic second-order logic of graphs; hybrid computation tree logic; and regular path queries. WL also serves as a framework to investigate the following natural questions: Is quantifying over walks more powerful than quantifying over paths (walks without repeating nodes) only? Is quantifying over infinite walks more powerful than quantifying over finite walks only? WL model checking is decidable, but determining the precise complexity remains an open problem.