Reasoning about priorities in default logic
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
The independent choice logic for modelling multiple agents under uncertainty
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Disjunctive logic programs with inheritance
Proceedings of the 1999 international conference on Logic programming
A System for Defeasible Argumentation, with Defeasible Priorities
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
On the Role of Negation in Choice Logic Programs
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
On the comparison of theories: preferring the most specific explanation
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Dynamic Decision-Making in Logic Programming and Game Theory
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Dynamically Ordered Probabilistic Choice Logic Programming
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Stability under Strategy Switching
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Revising knowledge in multi-agent systems using revision programming with preferences
CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Ordered Choice Logic Programs (OCLP), builds upon choice logic programs to define a preference/specialization relation on sets of choice rules. We show that our paradigm is an intuitive extension of both ordered logic and choice logic programming such that decisions can comprise more than two alternatives which become only available when a choice is actually forced. The semantics for OCL programs is based on stable models for which we supply a characterization in terms of assumption sets and a fixpoint algorithm. Furthermore we demonstrate that OCLPs allow an elegant translation of finite extensive games with perfect information such that the stable models of the program correspond, depending on the transformation, to either the Nash equilibria or the subgame perfect equilibria of the game.