Representing and Reasoning with Qualitative Preferences: Tools and Applications
Representing and Reasoning with Qualitative Preferences: Tools and Applications
复制标题
使用定性偏好进行表示和推理：工具和应用程序
DOI：
10.2200/s00689ed1v01y201512aim031
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Vasant G Honavar
中科院分区：
文献类型：
--
作者：
Ganesh Ram Santhanam;Samik Basu;Vasant G Honavar
这本书提供了一个教程，介绍了关于相对于一组选择的定性偏好的表示和推理的现代技术。综述了几种表示偏好语言的语法和语义，包括CP-nets、TCP-nets、CI-nets和cp -理论。介绍了偏好推理中的一些关键问题，包括确定一种选择是否优于另一种，或者它们是否等效，相对于给定的一组偏好。这些任务可以简化为时间逻辑中的模型检查。具体来说，表示给定偏好集的诱导偏好图可以使用用于计算树逻辑（CTL）的Kripke结构有效地编码。可以将关于一组首选项的首选项查询转换为CTL中等效的一组公式，这样，每当首选项查询成立时，CTL公式就会得到满足。这允许我们使用模型检查器来推断……
Abstract This book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL). One can translate preference queries with respect to a set of preferences into an equivalent set of formulae in CTL, such that the CTL formula is satisfied whenever the preference query holds. This allows us to use a model checker to reason abo...