Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89982-2_28 | ICLP |
Keywords | Field | DocType |
declarative semantics,revision programming,earlier semantics,logic programming,basic decision problem,justified weak repair,active integrity constraints,integrity constraint,original semantics,new semantics,justified repair,active integrity constraint,integrity constraints,decision problem | Logic program,Decision problem,Programming language,Computer science,Algorithm,Theoretical computer science,Data integrity,Logic programming,Formalism (philosophy),Semantics,Well-founded semantics | Conference |
Volume | ISSN | Citations |
5366 | 0302-9743 | 10 |
PageRank | References | Authors |
0.53 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luciano Caroprese | 1 | 140 | 21.01 |
| Mirosław Truszczyński | 2 | 1006 | 59.93 |