使用CI网编码单调多集偏好:初步报告
Encoding monotonic multi-set preferences using CI-nets: preliminary report
摘要:
CP网及其变体构成了指定和推理偏好的主要AI方法之一。CI-网,特别是,是一个CP启发的形式主义表示序数偏好的商品集,这通常需要是单调的。考虑到商品通常是多集合而不是集合,一个自然的问题是CI网络是否可以或多或少地直接用于编码多集合的偏好。我们在这里提供了一些初步的想法,如何实现这一点,在这个意义上,至少限制形式的推理,我们的框架,我们称之为“限制推理”,可以有效地减少到CI网的推理。然而,我们的框架允许编码偏好的多个集合与无限的多重性。我们还表明,它可以在何种程度上被用来表示的商品的多重性没有明确规定(“纯粹的定性偏好”)的偏好,以及潜在的使用我们的CI-网的泛化作为一个组成部分,最近的证据聚合系统。
英文摘要:
CP-nets and their variants constitute one of the main AI approaches for specifying and reasoning about preferences. CI-nets, in particular, are a CP-inspired formalism for representing ordinal preferences over sets of goods, which are typically required to be monotonic. Considering also that goods often come in multi-sets rather than sets, a natural question is whether CI-nets can be used more or less directly to encode preferences over multi-sets. We here provide some initial ideas on how to achieve this, in the sense that at least a restricted form of reasoning on our framework, which we call "confined reasoning", can be efficiently reduced to reasoning on CI-nets. Our framework nevertheless allows for encoding preferences over multi-sets with unbounded multiplicities. We also show the extent to which it can be used to represent preferences where multiplicites of the goods are not stated explicitly ("purely qualitative preferences") as well as a potential use of our generalization of CI-nets as a component of a recent system for evidence aggregation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。