面向基于条件偏好语句和基于广义加性效用语言的扩展知识编译图
An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
AI总结：
本文扩展条件偏好语句语言的知识编译图，分析优化、支配之外的等价性、条件化和变量消去等查询与转换的复杂性，并研究广义加性效用的表达能力及相关复杂度。
摘要：
条件偏好语句已被用于紧凑地表示组合域上的偏好。它们处于 CP-nets 及其泛化，以及词典偏好树的核心。若干工作已经讨论了某些查询（尤其是优化和支配）的复杂性。本文扩展了其中一些结果，并研究了迄今尚未涉及的其他查询，如等价性，以及诸如条件化和变量消去之类的转换，从而为基于条件偏好语句的语言贡献了一幅知识编译图。我们还研究了广义加性效用的表达能力，以及查询与转换的复杂性。
英文摘要：
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, and transformations, like conditioning and variable elimination, thereby contributing to a knowledge compilation map for languages based on conditional preference statements. We also study the expressiveness and complexity of queries and transformations for generalized additive utilities.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
