Rewriting Guarded Negation Queries

  • Vince Bárány
  • Michael Benedikt
  • Balder ten Cate
Conference paper

DOI: 10.1007/978-3-642-40313-2_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8087)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Vince Bárány
    • 1
  • Michael Benedikt
    • 2
  • Balder ten Cate
    • 3
  1. 1.LogicBlox Inc.AtlantaUSA
  2. 2.Department of Computer ScienceUniversity of OxfordUK
  3. 3.Department of Computer ScienceUC-Santa CruzUSA

Personalised recommendations