Variable Forgetting in Preference Relations over Propositional Domains

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.

Authors

• Philippe Besnard
• Jérôme Lang
• Pierre Marquis

Keywords

No keywords are indexed for this paper.