Abstract
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all unions of conjunctive queries, a restricted form of negation that suffices for expressing some common uses of negation in SQL queries, and a large class of integrity constraints. At the same time, as was recently shown, the syntax of GNFO is restrictive enough so that static analysis problems such as query containment are still decidable. This suggests that, in spite of its expressive power, GNFO queries are amenable to novel optimizations. In this paper we provide further evidence for this, establishing that GNFO queries have distinctive features with respect to rewriting. Our results include effective preservation theorems for GNFO, Craig Interpolation and Beth Definability results, and the ability to express the certain answers of queries with respect to GNFO constraints within very restricted logics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Add.-Wesley (1995)
Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of predicate logic. J. Phil. Logic 27, 217–274 (1998)
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The description logic handbook. Cambridge University Press (2003)
Bárány, V., Gottlob, G., Otto, M.: Querying the guarded fragment. In: LICS (2010)
Baget, J.-F., Leclère, M., Mugnier, M.-L.: Walking the decidability line for rules with existential variables. In: KR (2010)
Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Complexity boundaries for generalized guarded existential rules (2011) Research Report LIRMM 11006
Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: IJCAI (2011)
Bárány, V., ten Cate, B., Otto, M.: Queries with guarded negation. In: VLDB (2012)
Bárány, V., ten Cate, B., Segoufin, L.: Guarded negation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 356–367. Springer, Heidelberg (2011)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: PODS (2009)
Chang, C.C., Keisler, J.: Model Theory. North-Holland (1990)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer (1999)
Fagin, R.: Horn clauses and database dependencies. J. ACM 29(4), 952–985 (1982)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. TCS 336(1), 89–124 (2005)
Friedman, H.: The complexity of explicit definitions. AIM 20(1), 18–29 (1976)
Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66(4), 775–808 (2003)
Hoogland, E., Marx, M., Otto, M.: Beth definability for the guarded fragment. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 273–285. Springer, Heidelberg (1999)
Hoogland, E.: Definability and interpolation: model-theoretic investigations. PhD thesis, University of Amsterdam (2000)
Lenzerini, M.: Data integration: A theoretical perspective. In: PODS (2002)
Marx, M.: Queries determined by views: pack your views. In: PODS (2007)
Marnette, B.: Resolution and datalog rewriting under value invention and equality constraints. Technical report (2011), http://arxiv.org/abs/1212.0254
Nash, A., Segoufin, L., Vianu, V.: Views and queries: Determinacy and rewriting. ACM Trans. Database Syst. 35(3) (2010)
Otto, M.: Modal and guarded characterisation theorems over finite transition systems. APAL 130, 173–205 (2004)
Rosen, E.: Modal logic over finite structures. JLLI 6(4), 427–439 (1997)
Rossman, B.: Homomorphism preservation theorems. J. ACM 55(3) (2008)
ten Cate, B.: Interpolation for extended modal languages. JSL 70(1), 223–234 (2005)
van Benthem, J.F.A.K.: Modal Logic and Classical Logic. Humanities Pr. (1983)
Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bárány, V., Benedikt, M., ten Cate, B. (2013). Rewriting Guarded Negation Queries. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-40313-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40312-5
Online ISBN: 978-3-642-40313-2
eBook Packages: Computer ScienceComputer Science (R0)