Abstract
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, belief revision, and belief evolution in a transition system framework. The basic idea is to identify belief change problems with path-finding problems in a transition system. First, BE translates belief change problems into logic programs with answer sets corresponding to an agent’s evolving beliefs. Second, it uses existing smodels libraries to find the answer sets for the given logic programs. Conflicting observations are handled in a separate pre-processing phase, which is also based on finding answer sets.
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
Gelfond, M., Lifschitz, V.: Action languages. Linköping Electronic Articles in Computer and Information Science 3(16), 1–16 (1998)
Lang, J.: About time, revision, and update. In: Proceedings of NMR 2006 (June 2006)
Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet functions for contraction and revision. Journal of Symbolic Logic 50(2), 510–530 (1985)
Hunter, A., Delgrande, J.: An action description language for iterated belief change. In: Proceedings of IJCAI07 (January 2007)
Hunter, A., Delgrande, J.: Iterated belief change: A transition system approach. In: Proceedings of IJCAI05 (August 2005)
Moore, R.: A formal theory of knowledge and action. In: Hobbs, J., Moore, R. (eds.) Formal Theories of the Commonsense World, pp. 319–358. Ablex Publishing, Greenwich (1985)
Niemelä, I., Simons, P.: smodels - an implementation of stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 141–151. Springer, Heidelberg (1997)
Lifschitz, V., Turner, H.: Representing transition systems by logic programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 92–106. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hunter, A., Delgrande, J.P., Faber, J. (2007). Using Answer Sets to Solve Belief Change Problems. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)