Inconsistency in possibilistic knowledge bases: to live with it or not live with it
Fuzzy logic for the management of uncertainty
Default Reasoning: Causal and Conditional Theories
Default Reasoning: Causal and Conditional Theories
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Journal of Artificial Intelligence Research
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Inconsistency management and prioritized syntax-based entailment
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Reasoning with conditional ceteris paribus preference statements
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
LPOD answer sets and nash equilibria
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Dependencies Between Players in Boolean Games
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
Dependencies between players in Boolean games
International Journal of Approximate Reasoning
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Weighted Boolean formula games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Reasonably rational: reasoning about reasons behind preferences using modal logic
AT'13 Proceedings of the Second international conference on Agreement Technologies
| Hi-index | 0.00 |
Boolean games, introduced by [15,14], allow for expressing compactly two-players zero-sum static games with binary preferences: an agent's strategy consists of a truth assignment of the propositional variables she controls, and a player's preferences is expressed by a plain propositional formula. These restrictions (two-players, zero-sum, binary preferences) strongly limit the expressivity of the framework. While the first two can be easily encompassed by defining the agents' preferences as an arbitrary n-uple of propositional formulas, relaxing the last one needs Boolean games to be coupled with a propositional language for compact preference representation. In this paper, we consider generalized Boolean games where players' preferences are expressed within two of these languages: prioritized goals and propositionalized CP-nets.