ACM Home Page
Please provide us with feedback. Feedback
Active integrity constraints
Full text PdfPdf (238 KB)
Source
International Conference on Principles and Practice of Declarative Programming archive
Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming table of contents
Verona, Italy
Pages: 98 - 107  
Year of Publication: 2004
ISBN:1-58113-819-9
Authors
Sergio Flesca  University of Calabria, Rende, Italy
Sergio Greco  University of Calabria, Rende, Italy
Ester Zumpano  University of Calabria, Rende, Italy
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1013963.1013977
What is a DOI?

ABSTRACT

In this paper we deal with inconsistent databases and propose a logic framework that allows specifying sets of actions which should be performed to make databases consistent (repairs). The motivation of this work stems from the observation that in repairing a database it is natural to express among a set of update operations, the (preferred) actions which should be performed to repair the database. We introduce (conditioned) active integrity constraints, a simple and powerful form of active rules with declarative semantics, well suited for computing database repairs and consistent answers. We first consider a "prescriptive" semantics where the allowed actions are those specified by the constraints. Under such a semantics the existence of repairs and consistent answers is not guaranteed. Thus, we also investigate the class of universally quantified constraints under a different semantics where actions are interpreted as preference conditions on the set of possible repairs ("preferable" semantics). Under such a semantics every database with integrity constraints admits repairs and consistent answers. We show that (conditioned) active integrity constraints can be rewritten into disjunctive Datalog programs with classical negation and that (preferred) repairs can be derived through the computation of (preferred) disjunctive stable models. We study the complexity of computing repairs and consistent answers and show that active integrity constraints can also be used to express hard problems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Alferes J. J., J. A. Leite, Pereira L. M., Przymusinska H., and Przymusinski T.C. Dynamic updates of non-monotonic knowledge bases. Journal Logic Programming, 45(1-3):43--70, 2000.
 
3
4
 
5
Arenas M., Bertossi L., and Chomicki J. Specifying and querying database repairs using logic programs with exceptions. In Flexible Query-Answering Systems (FQAS), pages 27--41, 2000.
 
6
Baral C. and Zhang Y. On the semantics of knowledge update. In IJCAI Conference, pages 97--102, 2001.
 
7
Chitta C. Embedding revision programs in logic programming situation calculus. Journal of Logic Programming, 30(1):83--97, 1997.
 
8
 
9
 
10
 
11
12
 
13
 
14
Gelfond M. and Lifschitz V. The stable model semantics for logic programming. In ICLP/SLP, pages 1070--1080, 1988.
 
15
Gelfond M. and Lifschitz V. Classical negation in logic programs and disjunctive databases. NGC, 9(3/4):365--385, 1991.
 
16
 
17
 
18
 
19
 
20
Kowalski R.A. and Sadri F. Logic programs with exceptions. NGC, 9(3/4):387--400, 1991.
 
21
 
22
 
23
 
24
25
 
26
 
27
 
28

Collaborative Colleagues:
Sergio Flesca: colleagues
Sergio Greco: colleagues
Ester Zumpano: colleagues