The computational complexity of dominance and consistency in CP-nets
From MaRDI portal
Publication:3624167
zbMATH Open1182.68089arXiv1401.3453MaRDI QIDQ3624167FDOQ3624167
Authors:
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1401.3453
Recommendations
- CP-nets, \( \pi \)-pref nets, and Pareto dominance
- Expressive efficiency of two kinds of specific CP-nets
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Uniform random generation and dominance testing for CP-nets
- Computational techniques for a simple theory of conditional preferences
Cited In (22)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Efficient Computation of Dominance in Component Systems (Short Paper)
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
- Conditional lexicographic orders in constraint satisfaction problems
- Learning conditional preference networks
- Compact representation of preferences
- Possibilistic conditional preference networks
- Relational networks of conditional preferences
- A distributed social choice protocol for combinatorial domains
- A general framework for preferences in answer set programming
- Lexicographically-ordered constraint satisfaction problems
- Pruning external minimality checking for answer set programs using semantic dependencies
- Possibilistic preference networks
- Compactly representing utility functions using weighted goals and the Max aggregator
- Comparing the notions of optimality in CP-nets, strategic games and soft constraints
- Hard and soft constraints for reasoning about qualitative conditional preferences
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- Computational techniques for a simple theory of conditional preferences
- Uniform random generation and dominance testing for CP-nets
- Preference-based inconsistency-tolerant query answering under existential rules
- Expressive efficiency of two kinds of specific CP-nets
Uses Software
This page was built for publication: The computational complexity of dominance and consistency in CP-nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624167)
