Variable forgetting in preference relations over propositional domains

Authors:
Philippe Besnard;Jé/rô/me Lang;Pierre Marquis
Affiliations:
IRIT, UPS, 31062 Toulouse, France/ {besnard, lang}@irit.fr;IRIT, UPS, 31062 Toulouse, France/ {besnard, lang}@irit.fr;CRIL, U. d'Artois, 62307 Lens, France/ marquis@cril.univ-artois.fr
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 4
Cited 2

A valuation-based language for expert systems

International Journal of Approximate Reasoning
Modeling agents as qualitative decision makers

Artificial Intelligence - Special issue on economic principles of multi-agent systems
On strongest neccessary and weakest sufficient conditions

Artificial Intelligence
Possibility theory as a basis for qualitative decision theory

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Dependencies Between Players in Boolean Games

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dependencies between players in Boolean games

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Representing (and reasoning about) preference relations over combinatorial domains is computationally expensive. For many problems involving such preferences, it is relevant to simplify them by projecting them on a subset of variables. We investigate several possible definitions, focusing without loss of generality on propositional (binary) variables.