Expressive efficiency of two kinds of specific CP-nets
From MaRDI portal
Publication:527168
DOI10.1016/j.ins.2014.10.038zbMath1360.68815OpenAlexW2063551607MaRDI QIDQ527168
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.10.038
total orderpreference relationconditional preference networkexpressive efficiencyset-structured CP-net
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generic local computation
- Reasoning about preference dynamics.
- Computational techniques for a simple theory of conditional preferences
- Decision making with multiple objectives using GAI networks
- Logical preference representation and combinatorial vote
- Group decision making using incomplete fuzzy preference relations based on the additive consistency and the order consistency
- Everything else being equal: a modal logic for ceteris paribus preferences
- Preference structures and their numerical representations
- Representability of interval orders
- Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms
- Bribery in voting with CP-nets
- Truthful implementation and preference aggregation in restricted domains
- Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets
This page was built for publication: Expressive efficiency of two kinds of specific CP-nets