Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting
Aggregating preferences over combinatorial domains has many applications in artificial intelligence (AI). Given the inherent exponential nature of preferences over combinatorial domains, compact representation languages are needed to represent them, and (m)CP-nets are among the most studied ones. Se...
Main Authors: | Lukasiewicz, T, Malizia, E |
---|---|
格式: | Journal article |
语言: | English |
出版: |
Elsevier
2019
|
相似书籍
-
Complexity results for preference aggregation over (m)CP-nets: max and rank voting
由: Lukasiewicz, T, et al.
出版: (2021) -
On the complexity of mCP−nets
由: Lukasiewicz, T, et al.
出版: (2016) -
On Ontologies and CP−Nets
由: Di Noia, T, et al.
出版: (2013) -
Introducing Ontological CP−Nets
由: Noia, T, et al.
出版: (2012) -
Combining CP−Nets with the Power of Ontologies
由: Di Noia, T, et al.
出版: (2013)