论文信息 - Variable Forgetting in Preference Relations over Propositional Domains

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.

[1] Jürg Kohlas,et al. Handbook of Defeasible Reasoning and Uncertainty Management Systems , 2000 .

[2] R. Reiter,et al. Forget It ! , 1994 .

[3] Didier Dubois,et al. Possibility Theory as a Basis for Qualitative Decision Theory , 1995, IJCAI.

[4] Ronen I. Brafman,et al. Modeling Agents as Qualitative Decision Makers , 1997, Artif. Intell..

[5] P. Smets,et al. Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol 3 , 1998 .

[6] Ronen I. Brafman,et al. CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[7] Fangzhen Lin,et al. On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..

[8] Jérôme Lang,et al. Logical Preference Representation and Combinatorial Vote , 2004, Annals of Mathematics and Artificial Intelligence.

[9] Craig Boutilier,et al. CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments , 2004 .

[10] Dov M. Gabbay,et al. Handbook of defeasible reasoning and uncertainty management systems: volume 2: reasoning with actual and potential contradictions , 1998 .

[11] Prakash P. Shenoy,et al. A valuation-based language for expert systems , 1989, Int. J. Approx. Reason..