%0 Conference Proceedings %F Poster %T Variable Forgetting in Preference Relations over Propositional Domains %+ Logique, Interaction, Langue et Calcul (IRIT-LILaC) %+ Centre National de la Recherche Scientifique (CNRS) %+ Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) %+ Centre de Recherche en Informatique de Lens (CRIL) %A Besnard, Philippe %A Lang, Jérôme %A Marquis, Pierre %Z poster %< avec comité de lecture %B 17th European Conference on Artificial Intelligence (ECAI 2006) %C Riva del Garda, Italy %Y Gerhard Brewka %Y Silvia Coradeschi %Y Anna Perini %Y Paolo Traverso %I IOS Press %3 Frontiers in Artificial Intelligence and Applications %V 141 %P 763-764 %8 2006 %D 2006 %Z Computer Science [cs]/Artificial Intelligence [cs.AI]Conference poster %X 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. %G English %L hal-03300968 %U https://univ-artois.hal.science/hal-03300968 %~ UNIV-ARTOIS %~ UNIV-TLSE2 %~ UNIV-TLSE3 %~ CNRS %~ UNIV-DAUPHINE %~ UT1-CAPITOLE %~ LAMSADE-DAUPHINE %~ PSL %~ IRIT %~ IRIT-LILAC %~ UNIV-DAUPHINE-PSL %~ IRIT-IA %~ IRIT-CNRS %~ CRIL %~ TOULOUSE-INP %~ UNIV-UT3 %~ UT3-INP %~ UT3-TOULOUSEINP