Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexicographic preference trees. Several works have addressed the complexity of some queries (optimization, dominance in particular). We extend in this paper some of these results, and study other queries which have not been addressed so far, like equivalence, thereby contributing to a knowledge compilation map for languages based on conditional preference statements. We also introduce a new parameterised family of languages, which enables to balance expressiveness against the complexity of some queries.

中文翻译：

---

基于条件首选项语句的语言的知识汇编图

条件偏好语句已用于紧凑地表示组合域上的偏好。它们是CP网络及其泛化和词典学偏好树的核心。多项工作解决了一些查询的复杂性（尤其是优化，优势）。我们在本文中扩展了其中的一些结果，并研究了到目前为止尚未解决的其他查询（如等效性），从而为基于条件偏好语句的语言的知识编译图做出了贡献。我们还引入了一个新的参数化语言家族，它使表达能力与某些查询的复杂性保持平衡。