Queries with guarded negation

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1328-1339

  Bárány, Vince ^a   ten Cate, Balder ^b   Otto, Martin ^a  

^a UC ^*

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

CONJUNCTIVE QUERIES; CONSTRAINT LANGUAGE; DATA BASE THEORY; FINITE MODEL THEORY; QUERY ANSWERING; QUERY CONTAINMENT; QUERY EVALUATION; STRATIFIED NEGATION;

QUERY LANGUAGES;

EID: 84873100947     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350250     Document Type: Article

References (34)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. A. Arnold and D. Niwinski. Rudiments of μ-calculus. Elsevier, 2001.
3. J.-F. Baget, M. Lecl'ere, M.-L. Mugnier, and E. Salvat. On rules with existential variables: Walking the decidability line. Art. Intell., 175(10):1620-1654, 2011.
4. J.-F. Baget, M.-L. Mugnier, S. Rudolph, and M. Thomazo. Complexity Boundaries for Generalized Guarded Existential Rules. Technical Report lirmm-00568935, LIRMM, 2011.
5. J.-F. Baget, M.-L. Mugnier, S. Rudolph, and M. Thomazo. Walking the complexity lines for generalized guarded existential rules. In Proc. IJCAI, pages 712-717, 2011.
6. V. Bárány and M. Bojanczyk. Finite satisfiability for guarded fixpoint logic. IPL, 112(10):371-375, 2012.
7. V. Bárány, B. Ten Cate, and L. Segoufin. Guarded negation. In Proc. ICALP, pages 356-367, 2011.
8. J. Barwise and Y. N. Moschovakis. Global inductive definability. J. Symb. Log., 43(3):521-534, 1978.
9. A. Blumensath, M. Otto, and M. Weyer. Decidability results for the boundedness problem. Preprint at www.mathematik.tu-darmstadt.de/~otto/, 2011.
10. A. Cal'i{dotless}, G. Gottlob, and T. Lukasiewicz. Tractable query answering over ontologies with Datalog±. In Proc. Description Logics Workshop, 2009.
11. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. KR, pages 260-270, 2006.
12. B. ten Cate and L. Segoufin. Unary negation. In Proc. STACS, pages 344-355, 2011.
13. S. Chaudhuri and M. Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. J. Comput. Syst. Sci., 54(1):61-78, 1997.
14. T. Colcombet and C. Löding. The nesting-depth of disjunctive μ-calculus for tree languages and the limitedness problem. In Proc. CSL, pages 416-430, 2008.
15. S. Cosmadakis, H. Gaifman, P. Kanellakis, and M. Vardi. Decidable optimization problems for database logic programs. In Proc. STOC 1988, pages 477-490, 1988.
16. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Comput. Surv., 33(3):374-425, 2001.
17. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theoretical Computer Science, 336(1):89-124, 2005.
18. G. Gottlob, E. Grädel, and H. Veith. Datalog LITE: a deductive query language with linear time model checking. ACM Trans. Comput. Log., 3(1):42-79, 2002.
19. G. Gottlob and C. Koch. Monadic datalog and the expressive power of languages for Web information extraction. J. ACM, 51(1):74-113, 2004.
20. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In In Proc. LICS, pages 45-54, 1999.
21. G. Hillebrand, P. Kanellakis, H. Mairson, and M. Vardi. Undecidable boundedness problems for datalog programs. J. of Logic Prog., 25(2):163-190, 1995.
22. Y. E. Ioannidis and R. Ramakrishnan. Containment of conjunctive queries: beyond relations as sets. ACM Trans. Database Syst., 20(3):288-324, 1995.
23. A. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146-160, 1988.
24. D. Leinders, M. Marx, J. Tyszkiewicz, and J. Bussche. The semijoin algebra and the guarded fragment. J. of Logic, Lang. and Inf., 14(3):331-343, 2005.
25. L. Libkin. Expressive power of SQL. Theor. Comput. Sci., 296(3):379-404, 2003.
26. A. Madry. Data exchange: On the complexity of answering queries with inequalities. Inf. Process. Lett., 94(6):253-257, 2005.
27. M. Ortiz, D. Calvanese, and T. Eiter. Data complexity of Answering Unions of Conjunctive Queries in SHIQ. In Proc. Description Logics Workshop, 2006.
28. M. Otto. Expressive completeness through logically tractable models. Submitted, 2012.
29. R. Rosati. The limits of querying ontologies. In Proc. ICDT, pages 164-178, 2006.
30. Sloan Digital Sky Survey. Sky server sample SQL queries. http://skyserver.sdss.org/public/en/help/docs/realquery.asp. Accessed Sept. 25, 2011.
31. TPPC. TPC-DS benchmark. http://www.tpc.org/tpcds/. Release 2008-01-21.
32. TPPC. TPC-H benchmark. http://www.tpc.org/tpch/. Release 2.14.3.
33. R. Van Der Meyden. The complexity of querying indefinite data about linearly ordered domains. J. Comput. Syst. Sci., 54(1):113-135, 1997.
34. M. Y. Vardi. The complexity of relational query languages. In Proc. STOC 1982, pages 137-146, 1982.