Preference Aggregation with Incomplete CP-nets - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Preference Aggregation with Incomplete CP-nets

Abstract

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
haret_22666.pdf (234.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03622863 , version 1 (29-03-2022)

Identifiers

  • HAL Id : hal-03622863 , version 1
  • OATAO : 22666

Cite

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-318. ⟨hal-03622863⟩
8 View
4 Download

Share

Gmail Facebook X LinkedIn More