Graph logics with rational relations and the generalized intersection problem

Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Volumn , Issue , 2012, Pages 115-124

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

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

decidability and complexity; expressive power; logics for graphs; rational relations; recognizable relations; regular path queries; regular relations; subsequence; subword

Indexed keywords

EXPRESSIVE POWER; LOGICS FOR GRAPHS; RATIONAL RELATIONS; RECOGNIZABLE RELATIONS; REGULAR PATH QUERIES; REGULAR RELATIONS; SUBSEQUENCE; SUBWORDS;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; CONTEXT FREE LANGUAGES; SYNTACTICS; TOPOLOGY;

COMPUTATION THEORY;

EID: 84866919469     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2012.23     Document Type: Conference Paper

References (30)

1. R. Angles, C. Gutiérrez. Survey of graph database models. ACM Comput. Surv. 40(1): (2008).
2. K. Anyanwu, A. P. Sheth. ρ-Queries: enabling querying for semantic associations on the semantic web. In WWW'03.
3. P. Barceló, C. Hurtado, L. Libkin, P. Wood. Expressive languages for path queries over graph-structured data. In PODS, pages 3-14, 2010.
4. M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin. Definable relations and first-order query languages over strings. J. ACM 50(5):694-751 (2003).
5. J. Berstel. Transductions and Context-Free Languages. B. G. Teubner, 1979.
6. A. Blumensath and E. Grädel. Automatic structures. In LICS'00, pages 51-62.
7. V. Bruyère, G. Hansel, C. Michaux, R. Villemaire. Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc. 1 (1994), 191-238.
8. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In KR'00, pages 176-185.
9. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. View-based query processing and constraint satisfaction. In LICS, pages 361-371, 2000.
10. L. Cardelli, P. Gardner, G. Ghelli. A spatial logic for querying graphs. In ICALP'02, pages 597-610.
11. O. Carton, C. Choffrut, S. Grigorieff. Decision problems among the main subfamilies of rational relations. RAIRO/ITA, 40 (2006), 255-275.
12. P. Chambart, Ph. Schnoebelen. Post embedding problem is not primitive recursive, with applications to channel systems. In FSTTCS'07, pages 265-276.
13. P. Chambart, Ph. Schnoebelen. The ordinal recursive complexity of lossy channel systems. LICS'08, pages 205-216.
14. C. Choffrut. Relations over words and logic: a chronology. Bulletin of the EATCS 89 (2006), 159-163.
15. M. P. Consens, A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. In PODS'90, pages 404-416.
16. I. Cruz, A. Mendelzon, P. Wood. A graphical query language supporting recursion. In SIGMOD'87, pages 323-330.
17. A. Dawar, P. Gardner, G. Ghelli. Expressiveness and complexity of graph logic. Inf.& Comput. 205 (2007), 263-310.
18. A. Deutsch, V. Tannen. Optimization properties for classes of conjunctive regular path queries. DBPL'01, pages 21-39.
19. L. E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. The American Journal of Mathematics, 35(4):413-422, 1913.
20. C. Elgot and J. Mezei. On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965), 47-68.
21. D. Florescu, A. Levy, D. Suciu. Query containment for conjunctive queries with regular expressions. In PODS'98.
22. C. Frougny and J. Sakarovitch. Synchronized rational relations of finite and infinite words. TCS 108 (1993), 45-82.
23. O. Grumberg, O. Kupferman, S. Sheinvald. Variable automata over infinite alphabets. In LATA'10, pages 561-572.
24. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2(7):326-336, 1952.
25. L. Libkin, D. Vrgoč. Regular path queries on graphs with data. In ICDT'12.
26. 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.
27. M.H. Löb and S.S. Wainer. Hierarchies of number theoretic functions, I. Arch. Math. Logik Grund., 13:39-51, 1970.
28. M. Nivat. Transduction des langages de Chomsky. Ann. Inst. Fourier 18 (1968), 339-455.
29. H. Rose. Subrecursion: Functions and Hierarchies. Clarendon Press, 1984.
30. W. Thomas. Infinite trees and automaton-definable relations over ω-words. TCS 103 (1992), 143-159.