Talks and Poster Presentations (with Proceedings-Entry):
A. Haret, A. Novaro, U. Grandi:
"Preference Aggregation with Incomplete CP-Nets";
Talk: Principles of Knowledge Representation and Reasoning (KR),
Tempe, Arizona, USA;
2018-10-27
- 2018-11-02; in: "Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018",
AAAI Press,
(2018),
ISBN: 978-1-57735-803-9;
308
- 318.
English 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 ex-press 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 multi-ple 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.
Keywords:
CP-nets; preference aggregation; incomplete information; complexity
Electronic version of the publication:
https://publik.tuwien.ac.at/files/publik_273149.pdf
Related Projects:
Project Head Johannes Peter Wallner:
EMBArg
Created from the Publication Database of the Vienna University of Technology.