Graph logics with rational relations

Logical Methods in Computer Science

Volumn 9, Issue 3, 2013, Pages

  Barceló, Pablo ^a   Figueira, Diego ^b   Libkin, Leonid ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Graph databases; Intersection problem; Non primitive recursive; Rational relations; Recognizable relations; Regular relations; RPQ

Indexed keywords

GRAPH DATABASE; INTERSECTION PROBLEM; NON PRIMITIVE RECURSIVE; RATIONAL RELATIONS; RECOGNIZABLE RELATIONS; REGULAR RELATIONS; RPQ;

SYNTACTICS; TOPOLOGY;

CONTEXT FREE LANGUAGES;

EID: 84879961953     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-9(3:01)2013     Document Type: Article

References (34)

1. R. Angles, C. Gutiérrez. Survey of graph database models. ACM Computing Surveys 40 (1), 2008.
2. K. Anyanwu, A. P. Sheth. ρ-Queries: enabling querying for semantic associations on the semantic web. 12th International World Wide Web Conference (WWW), pages 690-699, 2003.
3. P. Barceló, D. Figueira, L. Libkin. Graph Logics with Rational Relations and the Generalized Intersection Problem. 27th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 115-124, 2012.
4. P. Barceló, L. Libkin, A. W. Lin, P. Wood. Expressive languages for path queries over graph-structured data. ACM Transactions on Database Systems, 37 (4) (2012).
5. M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin. Definable relations and first-order query languages over strings. Journal of the ACM 50 (5):694-751, 2003.
6. J. Berstel. Transductions and Context-Free Languages. B. G. Teubner, 1979.
7. A. Blumensath and E. Grädel. Automatic structures. 15th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 51-62, 2000.
8. V. Bruyère, G. Hansel, C. Michaux, R. Villemaire. Logic and p-recognizable sets of integers. Bulletin of the Belgium Mathematical Society 1, 191-238, 1994.
9. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Containment of conjunctive regular path queries with inverse. 7th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 176-185, 2000.
10. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. View-based query processing and constraint satisfaction. 15th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 361-371, 2000.
11. L. Cardelli, P. Gardner, G. Ghelli. A spatial logic for querying graphs. 29th International Colloquium on Automata, Languages and Programming (ICALP), pages 597-610, 2002.
12. O. Carton, C. Choffrut, S. Grigorieff. Decision problems among the main subfamilies of rational relations. Informatique Théorique et Applications, 40, pages 255-275, 2006.
13. P. Chambart, Ph. Schnoebelen. Post embedding problem is not primitive recursive, with applications to channel systems. 27th International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 265-276, 2007.
14. P. Chambart, Ph. Schnoebelen. The ordinal recursive complexity of lossy channel systems. 23rd Annual IEEE Symposium on Logic in Computer Science (LICS), pages 205-216, 2008.
15. C. Choffrut. Relations over words and logic: a chronology. Bulletin of the EATCS 89, 159-163, 2006.
16. M. P. Consens, A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. 9th ACM Symposium on Principles of Database Systems (PODS), pages 404-416, 1990.
17. I. Cruz, A. Mendelzon, P. Wood. A graphical query language supporting recursion. ACM Special Interest Group on Management of Data (SIGMOD), pages 323-330, 1987.
18. A. Dawar, P. Gardner, G. Ghelli. Expressiveness and complexity of graph logic. Information and Computation 205, pages 263-310, 2007.
19. A. Deutsch, V. Tannen. Optimization properties for classes of conjunctive regular path queries. 8th International Workshop on Database Programming Languages (DBPL), pages 21-39, 2001.
20. L. E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. The American Journal of Mathematics, 35 (4), pages 413-422, 1913.
21. C. Elgot and J. Mezei. On relations defined by generalized finite automata. IBM Journal of Research and Development 9, pages 47-68, 1965.
22. D. Florescu, A. Levy, D. Suciu. Query containment for conjunctive queries with regular expressions. 17th ACM Symposium on Principles of Database Systems (PODS), pages 139-148, 1998.
23. C. Frougny and J. Sakarovitch. Synchronized rational relations of finite and infinite words. Theoretical Computer Science 108, pages 45-82, 1993.
24. O. Grumberg, O. Kupferman, S. Sheinvald. Variable automata over infinite alphabets. 4th International Conference on Language and Automata Theory and Applications (LATA), pages 561-572, 2010.
25. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3), 2 (7), pages 326-336, 1952.
26. D. Kozen. Lower bounds for natural proof systems. 18th Annual Symposium on Foundations of Computer Science (FOCS), pages 254-266, 1977.
27. L. Libkin, D. Vrgoč. Regular path queries on graphs with data. 15th International Conference on Database Theory (ICDT), 2012.
28. L. Lisovik. The identity problem for regular events over the direct product of free and cyclic semigroups. Doklady Akad. Nauk Ukr., ser. A, 6 (1979), 410-413.
29. M.H. Löb and S.S. Wainer. Hierarchies of number theoretic functions, I. Archiv fr mathematische Logik und Grundlagenforschung, 13:39-51, 1970.
30. M. Nivat. Transduction des langages de Chomsky. Annales de l'Institut Fourier 18 (1968), 339-455.
31. H. Rose. Subrecursion: Functions and Hierarchies. Clarendon Press, 1984.
32. S. Schmitz and Ph. Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. 38th International Colloquium on Automata, Languages and Programming (ICALP), pages 441-452, 2011.
33. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83, pages 251-261, 2002.
34. W. Thomas. Infinite trees and automaton-definable relations over ω-words. Theoretical Computer Science 103, pages 143-159, 1992.