CP-网中支配性和一致性的计算复杂性
The Computational Complexity of Dominance and Consistency in CP-Nets
摘要：
我们研究了CP网的优势性和一致性检验的计算复杂性。以前，已经确定了限制类的依赖图的CP网络是无环的复杂性的优势。然而，有一些偏好定义了循环依赖图;这些都是用一般的CP网建模的。在我们的主要结果中，我们证明了一般CP网的优势和一致性都是PSPACE完全的。然后，我们考虑的概念，强优势，优势等价和优势不可比性，以及几个概念的最优性，并确定相应的决策问题的复杂性。在证明中使用的减少是从CNOPS规划，从而加强了早期建立的两个领域之间的联系。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
