Preference Aggregation with Incomplete CP-Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Preference Aggregation with Incomplete CP-Nets

Résumé

Generalized CP-nets (gCP-nets) extend standard CP-nets by allowing conditional preference tables to be incomplete. Such generality is desirable, as in practice users may want to express preferences over the values of a variable that depend only on partial assignments for other variables. In this paper we study aggregation of gCP-nets, under the name of multiple gCP-nets (mgCP-nets). Inspired by existing research on mCP-nets, we define different semantics for mgCP-nets and study the complexity of prominent reasoning tasks such as dominance, consistency and various notions of optimality.
Fichier principal
Vignette du fichier
Preference Aggregation with Incomplete CP-Nets.pdf (293.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03888672 , version 1 (07-12-2022)

Identifiants

  • HAL Id : hal-03888672 , version 1

Citer

Adrian Haret, Arianna Novaro, Umberto Grandi. Preference Aggregation with Incomplete CP-Nets. 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Oct 2018, Tempe, United States. pp.308-317. ⟨hal-03888672⟩
40 Consultations
9 Téléchargements

Partager

Gmail Facebook X LinkedIn More