AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
On stable social laws and qualitative equilibria
Artificial Intelligence
Answer set programming and plan generation
Artificial Intelligence
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
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
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Choice Logic Programs and Nash Equilibria in Strategic Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
| Hi-index | 0.00 |
This paper studies the notion of qualitative game theory in the context of multi-agent decision making. We use logic programs with ordered disjunction (LPODs), invented by Brewka, as representation and reasoning language for strategic form of games. Structure and rules of a game are represented as a LPODin which preferences of players are encoded as ordered disjunctive rules. Solution of a game is defined in terms of equilibria such that preferred answer sets of a LPOD representing a game correspond exactly to respective types of equilibria of the game. We also discuss games in which rules have been changed or players are wrong informed about the rules of a game.