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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Winslett, M.: Updating Logical Databases. Cambridge University Press, Cambridge (1990)
Caroprese, L., Greco, S., Sirangelo, C., Zumpano, E.: Declarative semantics of production rules for integrity maintenance. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 26–40. Springer, Heidelberg (2006)
Marek, W., Truszczyński, M.: Revision programming. Theoretical Computer Science 190, 241–277 (1998)
Pivkina, I.: Revision programming: a knowledge representation formalism. PhD thesis, Department of Computer Science, University of Kentucky (2001), http://lib.uky.edu/ETD/ukycosc2001d00022/pivkina.pdf
Caroprese, L., Truszczyński, M.: Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS, vol. 5293. Springer, Heidelberg (2008)
Caroprese, L., Greco, S., Zumpano, E.: Active integrity constraints for database consistency maintenance, Manuscript, IEEE TKDE (submitted, 2008)
Marek, W., Truszczyński, M.: Autoepistemic logic. Journal of the ACM 38, 588–619 (1991)
Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Annals of Mathematics and Artificial Intelligence 15, 289–323 (1995)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Lifschitz, V., Woo, T.: Answer sets in general nonmonotonic reasoning. In: Proceedings of KR 1992, pp. 603–614. Morgan Kaufmann, San Francisco (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caroprese, L., Truszczyński, M. (2008). Declarative Semantics for Active Integrity Constraints. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-89982-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89981-5
Online ISBN: 978-3-540-89982-2
eBook Packages: Computer ScienceComputer Science (R0)