The Computational Complexity of Dominance and Consistency in CP-Nets

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.

• Type: Journal
• Year: 2008
• Where: JAIR
• Authors: Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson
• Keywords: Dependency Graphs, General Cp-nets, JAIR 2008, Testing Dominance