Variable Forgetting in Preference Relations over Propositional Domains - Archive ouverte HAL Access content directly
Conference Poster Year : 2006

Variable Forgetting in Preference Relations over Propositional Domains

(1, 2) , (3, 2, 1) , (4)
1
2
3
4

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.
Not file

Dates and versions

hal-03300968 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03300968 , version 1

Cite

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⟩
40 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More