Abstract
We present a principled approach to the problem of belief revision in (non-monotonic) logic programming under the answer set semantics. Unlike previous approaches we use a belief base approach. Belief bases are sets of sentences that are, in contrast to belief sets, not deductively closed. We show that many of the classic base revision postulates are applicable to the logic programming case. We discuss further postulates for logic program revision and show that many of them follow from classical base revision postulates. For those postulates that do not follow from base revision postulates we propose new postulates that may also be justified from the base revision perspective. Moreover we develop a new construction for prioritized multiple base revision based on a consolidation operation via remainder sets. This construction is applicable in both the classical propositional and the logic programming cases. We connect postulates and construction by proving a representation theorem showing that the construction is exactly characterized by the proposed set of postulates.
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
Fermé, E., Hansson, S.: AGM 25 years. Journal of Philosophical Logic 40, 295–331 (2011), doi:10.1007/s10992-011-9171-9
Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming 2(6) (2002)
Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: Belief revision of logic programs under answer set semantics. In: Proc. of the 11th Int’l Conference on Principles of Knowledge Representation and Reasoning (KR 2008). AAAI Press (2008)
Slota, M., Leite, J.: On semantic update operators for answer-set programs. In: Proc. of the 19th European Conference on Artificial Intelligence, ECAI (2010)
Hansson, S.O.: A Textbook of Belief Dynamics. Kluwer Academic Publishers, Norwell (2001)
Gelfond, M., Leone, N.: Logic programming and knowledge representation — the A-Prolog perspective. Artificial Intelligence 138(1-2), 3–38 (2002)
Delgrande, J.P.: Horn clause belief change: Contraction functions. In: Proc. of the 11th int’l Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 156–165. AAAI Press (2008)
Delgrande, J.P.: An approach to revising logic programs under the answer set semantics. In: 13th Int’l Workshop on Non-Monotonic Reasoning, NMR 2010 (2010)
Osorio, M., Cuevas, V.: Updates in answer set programming: An approach based on basic structural properties. Theory Pract. Log. Program. 7(4), 451–479 (2007)
Woltran, S.: A common view on strong, uniform, and other notions of equivalence in answer-set programming. Theory Pract. Log. Program. 8(2), 217–234 (2008)
Alferes, J.J., Banti, F., Brogi, A., Leite, J.A.: The refined extension principle for semantics of dynamic logic programming. Studia Logica 79(1) (2005)
Hansson, S.O.: Semi-revision. Journal of Applied Non-Classical Logics 7(2) (1997)
Makinson, D.: Screened revision. Theoria. 63(1-2), 14–23 (1997)
Krümpelmann, P.: Dependency semantics for sequences of extended logic programs. Logic Journal of the IGPL (2012), doi: 10.1093/jigpal/jzs012
Kudo, Y., Murai, T.: A Method of Belief Base Revision for Extended Logic Programs Based on State Transition Diagrams. n: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004, Part I. LNCS (LNAI), vol. 3213, pp. 1079–1084. Springer, Heidelberg (2004)
Witteveen, G., van der Hoek, W.: A General Framework for Revising Nonmonotonic Theories. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 258–272. Springer, Heidelberg (1997)
Billington, D., Antoniou, G., Governatori, G., Maher, M.J.: Revising Nonmonotonic Theories: The Case of Defeasible Logic. In: Burgard, W., Christaller, T., Cremers, A.B. (eds.) KI 1999. LNCS (LNAI), vol. 1701, pp. 101–112. Springer, Heidelberg (1999)
Krümpelmann, P., Kern-Isberner, G.: On belief dynamics of dependency relations for extended logic programs. In: Proceedings of the 13th International Workshop on Non-Monotonic Reasoning, NMR 2010 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krümpelmann, P., Kern-Isberner, G. (2012). Belief Base Change Operations for Answer Set Programming. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-33353-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33352-1
Online ISBN: 978-3-642-33353-8
eBook Packages: Computer ScienceComputer Science (R0)