ICLP 2008: Logic Programming pp 269-283 | Cite as

Declarative Semantics for Active Integrity Constraints

  • Luciano Caroprese
  • Mirosław Truszczyński
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5366)

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.

Keywords

Logic Program Logic Programming Integrity Constraint Initial Database Disjunctive Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Winslett, M.: Updating Logical Databases. Cambridge University Press, Cambridge (1990)CrossRefMATHGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Marek, W., Truszczyński, M.: Revision programming. Theoretical Computer Science 190, 241–277 (1998)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    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
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Caroprese, L., Greco, S., Zumpano, E.: Active integrity constraints for database consistency maintenance, Manuscript, IEEE TKDE (submitted, 2008)Google Scholar
  7. 7.
    Marek, W., Truszczyński, M.: Autoepistemic logic. Journal of the ACM 38, 588–619 (1991)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Annals of Mathematics and Artificial Intelligence 15, 289–323 (1995)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)CrossRefMATHGoogle Scholar
  10. 10.
    Lifschitz, V., Woo, T.: Answer sets in general nonmonotonic reasoning. In: Proceedings of KR 1992, pp. 603–614. Morgan Kaufmann, San Francisco (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Luciano Caroprese
    • 1
  • Mirosław Truszczyński
    • 2
  1. 1.Università della CalabriaRendeItaly
  2. 2.Department of Computer ScienceUniversity of KentuckyLexingtonUSA

Personalised recommendations