The Computational Complexity of Dominance and Consistency in CP-Nets

Abstract

We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality, and identify the complexity of the corresponding decision problems. The reductions used in the proofs are from STRIPS planning, and thus reinforce the earlier established connections between both areas.

References in corpus (5)

• CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
• The Computational Complexity of Dominance and Consistency in CP-Nets
• Introducing Variable Importance Tradeoffs into CP-Nets
• Structure and Complexity in Planning with Unary Operators
• Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

Cited by in corpus (8)

• The Computational Complexity of Dominance and Consistency in CP-Nets
• Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting
• When Is It Acceptable to Break the Rules? Knowledge Representation of Moral Judgement Based on Empirical Data
• CPMetric: Deep Siamese Networks for Learning Distances Between Structured Preferences
• Solution Dominance over Constraint Satisfaction Problems
• Logical Conditional Preference Theories
• Modeling Contrary-to-Duty with CP-nets
• Encoding monotonic multi-set preferences using CI-nets: preliminary report