Skip to Main content Skip to Navigation
Poster communications

Variable Forgetting in Preference Relations over Propositional Domains

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.
Document type :
Poster communications
Complete list of metadata
Contributor : Fabien Delorme Connect in order to contact the contributor
Submitted on : Tuesday, July 27, 2021 - 12:38:17 PM
Last modification on : Tuesday, January 25, 2022 - 8:30:03 AM


  • HAL Id : hal-03300968, version 1


Philippe Besnard, Jérôme Lang, Pierre Marquis. Variable Forgetting in Preference Relations over Propositional Domains. Gerhard Brewka; Silvia Coradeschi; Anna Perini; Paolo Traverso. 17th European Conference on Artificial Intelligence (ECAI 2006), 2006, Riva del Garda, Italy. IOS Press, Proceedings ECAI 2006 ; ISBN: 978-1-58603-642-3, 141, pp.763-764, 2006, Frontiers in Artificial Intelligence and Applications. ⟨hal-03300968⟩



Les métriques sont temporairement indisponibles