Querying the guarded fragment

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 1-10

  Bárány, Vince ^a   Gottlob, Georg ^a   Otto, Martin ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Conjunctive queries; Descriptive complexity; Finite model theory; Guarded fragment; Hypergraph covers

Indexed keywords

COMPUTER CIRCUITS; DATA DESCRIPTION; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

CONJUNCTIVE QUERIES; DESCRIPTIVE COMPLEXITY; FINITE MODEL THEORY; GUARDED FRAGMENT; HYPERGRAPH;

GRAPH THEORY;

EID: 78449283182     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.26     Document Type: Conference Paper

References (22)

1. H. Andréka, J. van Benthem, and I. Németi, "Modal languages and bounded fragments of predicate logic," Journal of Philosophical Logic, vol. 27, pp. 217-274, 1998.
2. E. Grädel, "On the restraining power of guards," Journal of Symbolic Logic, vol. 64, no. 4, pp. 1719-1742, 1999.
3. -, "Decision procedures for guarded logics," in Proc. CADE'99, 1999, pp. 31-51.
4. I. Hodkinson, "Loosely guarded fragment of first-order logic has the finite model property," Studia Logica, vol. 70, pp. 205-240, 2002.
5. I. Hodkinson and M. Otto, "Finite conformal hypergraph covers and Gaifman cliques in finite structures," Bulletin of Symbolic Logic, vol. 9, pp. 387-405, 2003.
6. E. Grädel, "Description logics and guarded fragments of first-order logic," in Proc. DL'98. CEUR Electronic Workshop Proc., 1998.
7. R. Rosati, "On the decidability and finite controllability of query processing in databases with incomplete information," in Proc. PODS'06, 2006, pp. 356-365, full version submitted, available from author.
8. A. Calí, G. Gottlob, and M. Kifer, "Taming the infinite chase: query answering under expressive relational constraints," in Proc. KR'08, 2008, pp. 70-80.
9. ±: a unified approach to ontologies and integrity constraints," in Proc. ICDT'09, 2009, pp. 14-30.
10. -, "A general datalog-based framework for tractable query answering over ontologies," in Proc. PODS'09, 2009, pp. 77-86.
11. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati, "Data complexity of query answering in description logics," in Proc. KR'06, 2006, pp. 260-270.
12. -, "Tractable reasoning and efficient query answering in description logics: the DL-Lite family," pp. 385-429, 2007.
13. H. Pérez-Urbina, B. Motik, and I. Horrocks, "Tractable query answering and rewriting under description logic constraints," J. Applied Logic, vol. 8, no. 2, pp. 186-209, 2008.
14. M. Otto, "Highly acyclic groups, hypergraph covers and the guarded fragment," in Proc. LICS'10, 2010.
15. B. Herwig, "Extending partial isomorphisms on finite structures," Combinatorica, vol. 155, pp. 365-371, 2005.
16. C. Beeri and M. Y. Vardi, "A proof procedure for data dependencies," Journal of the ACM, vol. 31, no. 4, pp. 718-741, 1984.
17. -, "The implication problem for data dependencies," in Proc. ICALP'81, 1981, pp. 73-85.
18. D. S. Johnson and A. C. Klug, "Testing containment of conjunctive queries under functional and inclusion dependencies," JCSS, vol. 28, no. 1, pp. 167-189, 1984.
19. R. Fagin, P. Kolaitis, R. J. Miller, and L. Popa, "Data exchange: semantics and query answering," Theoretical Computer Science, vol. 336, no. 1, pp. 89-124, 2005.
20. M. Otto, "Avoiding incidental homomorphisms into guarded covers," TU Darmstadt, Tech. Rep. 2600, 2009.
21. M. Otto, "Bisimulation-invariant Ptime and higher-dimensional μ-calculus," Theoretical Computer Science, vol. 224, pp. 237-265, 1999.
22. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, "On the desirability of acyclic database schemes," Journal of the ACM, vol. 30, no. 3, pp. 479-513, 1983.