Abstract
We present a framework for decision making with circumstance-dependent preferences and decisions. This formalism, called Ordered Choice Logic Programming, allows decisions that comprise multiple alternatives, which become available only when a choice between them is forced. The skeptical semantics is based on answer sets for which we provide a fixpoint characterization and a bottom-up algorithm. OCLPs can be used to represent and extend game theory concepts. We demonstrate that OCLPs allow an elegant translation of finite extensive games with perfect information such that the c-answer sets correspond to the Nash equilibria of the game. These equilibria are not player-deterministic, in the sense that a single player, given the other players’ actions, could rationally leave an equilibrium state by changing her action profile. Therefor cautious Nash equilibria are introduced as the answer sets of the transformed game.
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
JosĂ© JĂşlio Alferes, Leite J. A., LuĂs Moniz Pereira, Halina Przymusinska, and Teodor C. Przymusinski. Dynamic logic programming. In Cohn et al. [CSS98], pages 98–111.
Gerhard Brewka and Thomas Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1–2):297–356, April 1999.
Francesco Buccafurri, Nicola Leone, and Pasquale Rullo. Disjunctive ordered logic: Semantics and expressiveness. In Cohn et al. [CSS98], pages 418–431.
Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence Research, 4:19–36, 1996.
Anthony G. Cohn, Lenhard K. Schubert, and Stuart C. Shapiro, editors. Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, 1998. Morgan Kaufmann.
Marina DeVos and Dirk Vermeir. On the Role of Negation in Choice Logic Programs. In Michael Gelfond, Nicola Leone, and Gerald Pfeifer, editors, Logic Programming and Non-Monotonic Reasoning Conference (LPNMR’99), volume 1730 of LNAI, pages 236–246, 1999. Springer Verlag.
Marina DeVos and Dirk Vermeir. A Logic for Modelling Decision Making with Dynamic Preferences. In Proceedings of the Logic in Artificial Intelligence (Jelia2000) workshop, number 1999 in LNAI, pages 391–406, 2000. Springer Verlag.
Vladimir Lifschitz. Answer set programming and plan generation. Journal of Artificial Intelligence, page to appear, 2000.
Els Laenens and Dirk Vermeir. A Fixpoint Semantics of Ordered Logic, Journal of Logic and Computation, 1(2), pp. 159–185, 1990.
Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. The MIT Press, Cambridge, Massachusets, London, England, third edition, 1996.
Chiaki Sakama and Katsumi Inoue. Representing Priorities in Logic Programs. In Michael Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, pages 82–96, 1996. MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Vos, M., Vermeir, D. (2002). Dynamic Decision-Making in Logic Programming and Game Theory. In: McKay, B., Slaney, J. (eds) AI 2002: Advances in Artificial Intelligence. AI 2002. Lecture Notes in Computer Science(), vol 2557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36187-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-36187-1_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00197-3
Online ISBN: 978-3-540-36187-9
eBook Packages: Springer Book Archive