A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Infinite trees and automaton-definable relations over &ohgr;-words
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Optimization Properties for Classes of Conjunctive Regular Path Queries
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Expressiveness and complexity of graph logic
Information and Computation
Survey of graph database models
ACM Computing Surveys (CSUR)
The Ordinal Recursive Complexity of Lossy Channel Systems
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
On relations defined by generalized finite automata
IBM Journal of Research and Development
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Variable automata over infinite alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
The parametric ordinal-recursive complexity of post embedding problems
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Spanners: a formal framework for information extraction
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 32nd symposium on Principles of database systems
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
Querying graphs with preferences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword (factor) or subsequence. Evaluating formulae in such extended graph logics boils down to checking nonemptiness of the intersection of rational relations with regular or recognizable relations (or, more generally, to the generalized intersection problem, asking whether some projections of a regular relation have a nonempty intersection with a given rational relation). We prove that for several basic and commonly used rational relations, the intersection problem with regular relations is either undecidable (e.g., for subword or suffix, and some generalizations), or decidable with non-multiply-recursive complexity (e.g., for subsequence and its generalizations). These results are used to rule out many classes of graph logics that freely combine regular and rational relations, as well as to provide the simplest problem related to verifying lossy channel systems that has non-multiply-recursive complexity. We then prove a dichotomy result for logics combining regular conditions on individual paths and rational relations on paths, by showing that the syntactic form of formulae classifies them into either efficiently checkable or undecidable cases. We also give examples of rational relations for which such logics are decidable even without syntactic restrictions.