Fixpoint Semantics for Active Integrity Constraints

Bart Bogaerts, Luís Cruz-Filipe

Research output: Contribution to journalJournal articleResearchpeer-review

85 Downloads (Pure)

Abstract

Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints are violated. The intuitions regarding which repairs are “good” given such a description are closely related to intuitions that live in various areas of non-monotonic reasoning, such as logic programming and autoepistemic logic. In this paper, we apply approximation fixpoint theory, an abstract, algebraic framework designed to unify semantics of non-monotonic logics, to the field of AICs. This results in a new family of semantics for AICs. We study properties of our new semantics and relationships to existing semantics. In particular, we argue that two of the newly defined semantics stand out. Grounded repairs have a simple definition that is purely based on semantic principles that semantics for AICs should adhere to. And, as we show, they coincide with the intended interpretation of AICs on many examples. The second semantics of interest is the AFT-well-founded semantics: it is a computationally cheap semantics that provides upper and lower bounds for many other classes of repairs.

Original languageEnglish
JournalArtificial Intelligence
Volume255
Pages (from-to)43-70
ISSN0004-3702
DOIs
Publication statusPublished - Feb 2018

    Fingerprint

Keywords

  • Active integrity constraints
  • Approximation fixpoint theory

Cite this