• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Compact Representations of Preferences

Thumbnail
Date
2020
Dewey
Intelligence artificielle
Sujet
Preferences; CP nets; GAI nets; Logical Representations
DOI
http://dx.doi.org/10.1007/978-3-030-06164-7_7
Author
Pierre Marquis, Odile Papini, Henri Prade
Publisher
Springer
Year
2020
ISBN
978-3-030-06164-7
Book URL
10.1007/978-3-030-06164-7
URI
https://basepub.dauphine.fr/handle/123456789/20866
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Kaci, Souhila
Lang, Jérôme
Perny, Patrice
Type
Chapitre d'ouvrage
Item number of pages
217-252
Abstract (EN)
This chapter presents the main families of representation languages for preferences on combinatorial domains (composed by several attributes or variables with discrete value domains). In the first part of the chapter, we present the problem in its full generality. A large part of these languages are said to be graphical, because they work by expressing elementary preferences in a local way, using structural independence properties that are represented under the form of a graph. In the second (respectively, third) part of the chapter we review graphical languages for expressing ordinal (respectively, cardinal) preferences. Another class of preference representation languages makes use of (propositional) logic; they will be reviewed in the fourth part of the chapter, together with proper ‘preference logics’.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.