Declarative semantics for active integrity constraints

Luciano Caroprese, Mirosław Truszczyński

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


We study active integrity constraints, a formalism designed to describe integrity constraints on databases and to specify preferred ways to enforce them. The original semantics proposed for active integrity constraints is based on the concept of a founded repair. We point out that groundedness underlying founded repairs does not prevent cyclic justifications and so, may be inappropriate in some applications. Thus, using a different notion of grounding, with roots in logic programming and revision programming, we introduce two new semantics: of justified weak repairs, and of justified repairs. We study properties of these semantics, relate them to earlier semantics of active integrity constraints, and establish the complexity of basic decision problems.

Original languageEnglish
Title of host publicationLogic Programming - 24th International Conference, ICLP 2008, Proceedings
Number of pages15
StatePublished - 2008
Event24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy
Duration: Dec 9 2008Dec 13 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5366 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference24th International Conference on Logic Programming, ICLP 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Declarative semantics for active integrity constraints'. Together they form a unique fingerprint.

Cite this