The computational complexity of propositional STRIPS planning
Artificial Intelligence
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Hard and soft constraints for reasoning about qualitative conditional preferences
Journal of Heuristics
The computational complexity of choice sets
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
An Efficient Upper Approximation for Conditional Preference
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Extending CP-nets with stronger conditional preference statements
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Constraint-based preferential optimization
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Voting on multiattribute domains with cyclic preferential dependencies
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Structure and complexity in planning with unary operators
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
On graphical modeling of preference and importance
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The computational complexity of dominance and consistency in CP-nets
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning with conditional ceteris paribus preference statements
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Introducing variable importance tradeoffs into CP-nets
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Learning conditional preference networks
Artificial Intelligence
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
An Efficient Procedure for Collective Decision-making with CP-nets
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Preferences in AI: An overview
Artificial Intelligence
Computational techniques for a simple theory of conditional preferences
Artificial Intelligence
Efficient heuristic approach to dominance testing in CP-nets
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Majority-rule-based preference aggregation on multi-attribute domains with CP-nets
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Pruning rules for constrained optimisation for conditional preferences
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Expert Systems with Applications: An International Journal
Ordering based decision making - A survey
Information Fusion
Strong equivalence of qualitative optimization problems
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
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.