Abstract
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, DOP-CLP, that allows the user to specify the static priority of each rule and to declare, dynamically, all the alternatives for the decisions that have to be made. In this paper we focus on a semantics that reflects all possible situations in which the decision maker takes the most rational, possibly probabilistic, decisions given the circumstances. Our model theory, which is a generalization of classical logic-programming model theory, captures uncertainty at the level of total Herbrand interpretations. We also demonstrate that DOP-CLPs can be used to formulate game theoretic concepts.
Wishes to thank the FWO for its support.
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
Fahiem Bacchus. LP, a Logic for Representing and Reasoning with Statistical Knowledge. Computational Intelligence, 6:209–231, 1990.
Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Articficial Intelligence Research, 4:19–36, 1996.
Francesco Buccafurri, Wolfgang Faber, and Nicola Leone. Disjunctive Logic Programs with Inheritance. In Danny De Schreye, editor, International Conference on Logic Pro-gramming (ICLP), pages 79–93, Las Cruces, New Mexico, USA, 1999. The MIT Press.
Marina De Vos and Dirk Vermeir. Choice Logic Programs and Nash Equilibria in Strategic Games. In Jörg Flum and Mario RodrÃguez-Artalejo, editors, Computer Science Logic (CSL’99), volume 1683 of Lecture Notes in Computer Science, pages 266–276, Madrid, Spain, 1999. Springer Verslag.
Marina De Vos 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 Lecture Notes in Artificial Intelligence, pages 236–246, El Paso, Texas, USA, 1999. Springer Verslag.
Marina De Vos and Dirk Vermeir. A Logic for Modelling Decision Making with Dynamic Preferences. Accepted at Jelia 2000. Lecture Notes in Artificial Intelligence. Springer Ver-slag.
Phan Minh Dung. On the acceptability of arguments and its fundamental role in nonmono-tonic reasoning, logic programming and n-person games. Artificial Intelligence, 77(2):321–358, 1995.
D. Gabbay, E. Laenens, and D. Vermeir. Credulous vs. Sceptical Semantics for Ordered Logic Programs. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd In-ternational Conference on Principles of Knowledge Representation and Reasoning, pages 208–217, Cambridge, Mass, 1991. Morgan Kaufmann.
Raymond Ng and V.S. Subrahmanian. A semantical framework for supporting subjective and conditional probabilities in deductive databases. In Koichi Furukawa, editor, Proceed-ings of the 8th International Conference on Logic Programming, pages 565–580. MIT, June 1991.
Liem Ngo. Probabilistic Disjunctive Logic Programming. In Eric Horvitz and Finn Jensen, editors, Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (AI-96), pages 387–404, San Francisco, aug 1996. Morgan Kaufmann Publishers.
Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. The MIT Press, Cambridge, Massachusets, London, Engeland, third edition, 1996.
David Poole. Logic programming, abduction and probability. In Institute for New Gener-ation Computer Technology (ICOT), editor, Proceedings for the International Conference on Fifth Generation Computer Systems, pages 530–538. IOS Press, 1992.
David Poole. The independent choice logic for modeling multiple agents under uncertainty. Artificial Intelligence, 94(1–2):7–56, 1997.
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, Cambridge, September2-6 1996. MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Vos, M., Vermeir, D. (2000). Dynamically Ordered Probabilistic Choice Logic Programming. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive