Declarative semantics for active integrity constraints

Luciano Caroprese; Mirosław Truszczyński

doi:10.1007/978-3-540-89982-2_28

Declarative semantics for active integrity constraints

Luciano Caroprese, Mirosław Truszczyński

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

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 language	English
Title of host publication	Logic Programming - 24th International Conference, ICLP 2008, Proceedings
Pages	269-283
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-540-89982-2_28
State	Published - 2008
Event	24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy Duration: Dec 9 2008 → Dec 13 2008

Publication series

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

Conference

Conference	24th International Conference on Logic Programming, ICLP 2008
Country/Territory	Italy
City	Udine
Period	12/9/08 → 12/13/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-89982-2_28

Cite this

Caroprese, L., & Truszczyński, M. (2008). Declarative semantics for active integrity constraints. In Logic Programming - 24th International Conference, ICLP 2008, Proceedings (pp. 269-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5366 LNCS). https://doi.org/10.1007/978-3-540-89982-2_28

@inproceedings{89e2fc41c15547ea8cd6e0e5aca8b695,

title = "Declarative semantics for active integrity constraints",

abstract = "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.",

author = "Luciano Caroprese and Miros{\l}aw Truszczy{\'n}ski",

year = "2008",

doi = "10.1007/978-3-540-89982-2_28",

language = "English",

isbn = "3540899812",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "269--283",

booktitle = "Logic Programming - 24th International Conference, ICLP 2008, Proceedings",

note = "24th International Conference on Logic Programming, ICLP 2008 ; Conference date: 09-12-2008 Through 13-12-2008",

}

Caroprese, L & Truszczyński, M 2008, Declarative semantics for active integrity constraints. in Logic Programming - 24th International Conference, ICLP 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5366 LNCS, pp. 269-283, 24th International Conference on Logic Programming, ICLP 2008, Udine, Italy, 12/9/08. https://doi.org/10.1007/978-3-540-89982-2_28

Declarative semantics for active integrity constraints. / Caroprese, Luciano; Truszczyński, Mirosław.
Logic Programming - 24th International Conference, ICLP 2008, Proceedings. 2008. p. 269-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5366 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Declarative semantics for active integrity constraints

AU - Caroprese, Luciano

AU - Truszczyński, Mirosław

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=58549107443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58549107443&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89982-2_28

DO - 10.1007/978-3-540-89982-2_28

M3 - Conference contribution

AN - SCOPUS:58549107443

SN - 3540899812

SN - 9783540899815

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 269

EP - 283

BT - Logic Programming - 24th International Conference, ICLP 2008, Proceedings

T2 - 24th International Conference on Logic Programming, ICLP 2008

Y2 - 9 December 2008 through 13 December 2008

ER -

Declarative semantics for active integrity constraints

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this