Abstract
We investigate revision programming, a formalism to describe constraints on belief sets (databases, knowledge bases), and to specify preferred ways to enforce them. We propose several semantics for revision programs combining ideas from logic programming and active integrity constraints, a formalism to model preferred ways to enforce integrity constraints on databases. We present results on the complexity of the semantics we introduce. We also show that all these semantics are invariant under “shifting”. Finally, we prove that from the perspective of a broad semantic landscape of revision programming, there is a direct correspondence between revision programs and active integrity constraints.
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
Marek, W., Truszczyński, M.: Revision specifications by means of programs. In: MacNish, C., Moniz Pereira, L., Pearce, D.J. (eds.) JELIA 1994. LNCS, vol. 838, pp. 122–136. Springer, Heidelberg (1994)
Marek, W., Truszczyński, M.: Revision programming. Theoretical Computer Science 190, 241–277 (1998)
Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Proceedings of ICLP 1988, pp. 1070–1080. MIT Press, Cambridge (1988)
Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and data bases, pp. 293–322. Plenum Press, New York (1978)
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
McCarthy, J.: Circumscription — a form of non-monotonic reasoning. Artificial Intelligence 13, 27–39 (1980)
Winslett, M.: Updating Logical Databases. Cambridge University Press, Cambridge (1990)
Caroprese, L., Truszczyński, M.: Declarative semantics for active integrity constraints (submitted, 2008), http://www.cs.uky.edu/ai/aic-full.pdf
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)
Lifschitz, V., Woo, T.: Answer sets in general nonmonotonic reasoning. In: Proceedings of KR 1992, pp. 603–614. Morgan Kaufmann, San Francisco (1992)
Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 369–389 (1999)
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 Revision Programming and Connections to Active Integrity Constraints. In: Hölldobler, S., Lutz, C., Wansing, H. (eds) Logics in Artificial Intelligence. JELIA 2008. Lecture Notes in Computer Science(), vol 5293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87803-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-87803-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87802-5
Online ISBN: 978-3-540-87803-2
eBook Packages: Computer ScienceComputer Science (R0)