An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
From MaRDI portal
Publication:6630721
DOI10.1007/S10472-024-09935-9MaRDI QIDQ6630721FDOQ6630721
Stefan Mengel, Hélène Fargier, Jérôme Mengin
Publication date: 31 October 2024
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Individual preferences (91B08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Learning conditionally lexicographic preference relations
- Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets
- The complexity of power-index comparison
- Computational techniques for a simple theory of conditional preferences
- Learning conditional preference networks
- Graphical Models: Queries, Complexity, Algorithms
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- Voting on multi-issue domains with conditionally lexicographic preferences
Cited In (1)
This page was built for publication: An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6630721)
