• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>20th European conference on artificial intelligence >Importance-based Semantics of Polynomial Comparative Preference Inference
【24h】

Importance-based Semantics of Polynomial Comparative Preference Inference

机译：多项式比较偏好推理的基于重要性的语义

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A basic task in preference reasoning is inferring a preference between a pair of outcomes (alternatives) from an input set of preference statements. This preference inference task for comparative preferences has been shown to be computationally very hard for the standard kind of inference. Recently, a new kind of preference inference has been developed, which is polynomial for relatively expressive preference languages, and has the additional property of being much less conservative; this can be a major advantage, since it will tend to make the number of undominated outcomes smaller. It derives from a semantics where models are weak orders that are generated by objects called cp-trees, which represent a kind of conditional lexicographic order. We show that there are simple conditions, based on the notion of importance, that determine whether a weak order can be generated by a cp-tree of the given form. This enables a simple characterisation of the less conservative preference inference. We go on to study the importance properties satisfied by a simple kind of cp-tree, leading to another characterisation of the corresponding preference inference.
机译：偏好推理的基本任务是从一组偏好语句的输入中推断一对结果（替代）之间的偏好。对于标准偏好而言，这种用于比较偏好的偏好推理任务在计算上非常困难。最近，开发了一种新的偏好推理，该偏好推理是相对表达的偏好语言的多项式，并且具有不那么保守的额外特性。这可能是一个主要优势，因为它将使较少的不确定结果数量减少。它源于语义，其中模型是由称为cp-tree的对象生成的弱命令，它表示一种条件词典顺序。我们展示了基于重要性概念的简单条件，这些条件确定是否可以通过给定形式的cp树生成弱订单。这使得对较不保守的偏好推断的简单表征成为可能。我们继续研究简单的cp树所满足的重要性属性，从而得出相应偏好偏好推断的另一种特征。

著录项

  • 来源
  • 会议地点 Montpellier(FR)
  • 作者

    Nic Wilson;

  • 作者单位

    Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号