Abstract
An agent may have preferences over states and an agent may have preferences over actions. In this paper, we explore the connection between these distinct forms of preference, in the context where action effects are given by a transition system. We illustrate that preferences over actions can not always be reduced to preferences over states, even under very general conditions. It is possible, however, to define a natural notion of consistency between the two forms of preference. Moreover, it is possible to precisely specify which preferences over actions can be expressed in terms of preferences over states. We encode preferences over actions in a logic programming framework that allows us to automatically determine when preferences over actions can be reduced to preferences over states. Our framework facilitates the high-level analysis of preferences by making conflicts explicit. We conclude with a general discussion of conflicting preferences, and we suggest some topics for future work.
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
Alchourron, C., Gardenfors, 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)
Bradley, R.: The kinematics of belief and desire. Synthese 156(3), 513–535 (2007)
Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artificial Intelligence 89(1-2), 1–29 (1997)
Freund, M.: On the revision of preferences and rational inference processes. Artificial Intelligence 152(1), 105–137 (2004)
Freund, M.: Revising preferences and choices. Journal of Mathematical Economics 41, 229–251 (2005)
Gelfond, M., Lifschitz, V.: Action languages. Linköping Electronic Articles in Computer and Information Science 3(16), 1–16 (1998)
Grove, A.: Two modellings for theory change. Journal of Philosophical Logic 17(2) (1988)
Hansson, S.O.: Changes in preferences. Theory and Decision 38, 1–28 (1995)
Hansson, S.O.: The structure of values and norms. Cambridge University Press (2001)
Halpern, J.: Defining relative likelihood inpartially ordered preferential structures. Journal of Artificial Intelligence Research 7, 1–24 (1997)
Horty, J.: Agency and Deontic Logic. Oxford University Press (2001)
Hunter, A., Delgrande, J.P.: An Action Description Language for Iterated Belief Change. In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2007 (2007)
Lang, J., van der Torre, L., Weydert, E.: Utilitarian Desires. International Journal on Autonomous Agents and Multi-Agent Systems 5, 329–363 (2002)
Lang, J., van der Torre, L.: From belief change to preference change. In: Proceedings of the European Conference on Artificial Intelligence, ECAI 2008 (2008)
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)
Mitchell, T.: Machine Learning. McGraw-Hill (1997)
van Benthem, J.: Dynamic logic for belief revision. Journal of Applied Non-Classical Logics 17, 129–156 (2007)
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Synthese Library 337. Springer (2007)
von Wright, H.H.: The logic of preference. Edinburgh University Press (1963)
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
Hunter, A. (2012). Actions, Preferences, and Logic Programs. In: Kosseim, L., Inkpen, D. (eds) Advances in Artificial Intelligence. Canadian AI 2012. Lecture Notes in Computer Science(), vol 7310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30353-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-30353-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30352-4
Online ISBN: 978-3-642-30353-1
eBook Packages: Computer ScienceComputer Science (R0)