The computational complexity of dominance and consistency in CP-nets

Authors:
Judy Goldsmith;Jérôme Lang;Miroslaw Truszczynski;Nic Wilson
Affiliations:
Dept. of Comp. Sci., University of Kentucky, Lexington, KY;IRIT, Universit´e Paul Sabatier, Toulouse Cedex, France;Dept. of Comp. Sci., University of Kentucky, Lexington, KY;Cork Constraint, Computation Centre, University College Cork, Ireland
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 8
Cited 13

The computational complexity of propositional STRIPS planning

Artificial Intelligence
Logical Preference Representation and Combinatorial Vote

Annals of Mathematics and Artificial Intelligence
Extending CP-nets with stronger conditional preference statements

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structure and complexity in planning with unary operators

Journal of Artificial Intelligence Research
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

IJCAI'03 Proceedings of the 18th 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

Hard and soft constraints for reasoning about qualitative conditional preferences

Journal of Heuristics
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
An Efficient Deduction Mechanism for Expressive Comparative Preferences Languages

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Prioritized component systems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Voting on multiattribute domains with cyclic preferential dependencies

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On graphical modeling of preference and importance

Journal of Artificial Intelligence Research
The computational complexity of dominance and consistency in CP-Nets

Journal of Artificial Intelligence Research
Efficient inference for expressive comparative preference languages

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Web Service Selection with Incomplete or Inconsistent User Preferences

ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Lexicographically-ordered constraint satisfaction problems

Constraints
Computational techniques for a simple theory of conditional preferences

Artificial Intelligence
Conditional lexicographic orders in constraint satisfaction problems

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Top-k retrieval using conditional preference networks

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only 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. We show here that both dominance and consistency testing for general CP-nets are PSPACE-complete. The reductions used in the proofs are from STRIPS planning, and thus establish strong connections between both areas.