一种基于多类型偏好的偏好逻辑
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant No.90412014 (国家自然科学基金); the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2003001 (江苏省自然科学基金)

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [14]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    针对目前缺乏多类型偏好共存的偏好逻辑系统的现状,提出并构造了一个能够描述和推理多种类型偏好的逻辑系统MPL(logic of many kinds of preference).在进一步提出MPL语言LMPL基于最粗糙/最细致描述原则的非单调语义基础上,通过分级知识库这种常用偏好表示方法的LMPL重写,初步考察了LMPL表示能力,最后进行总结并提出需要进一步研究解决的问题.

    Abstract:

    Presently,a whole logic system is still absent to represent and reason various kinds of preferences.In this paper,a preference logic MPL(logic of many kinds of preference)is introduced to supply the gap.In addition, recurring to the minimal/maximal specificity principle,a non-monotonic semantics of MPL's language LMPL is defined,and the application and capability of MPL are initially investigated by rewriting preferences expressed by ranked knowledge based into LMPL.Moreover,the conclusion and the prospective are presented in the end.

    参考文献
    [1]Doyle J.Prospects for preferences.Computational Intelligence,2004,20(2):111-136.
    [2]Oztürk M,Tsoukiàs A,Vincke P.Preference modelling.In:Ehrgott M,Greco S,Figueira J,eds.State of the Art in Multiple Criteria Decision Analysis.Berlin:Springer-Verlag,2005.27-72.
    [3]Kikuti D,Cozman FG,de Campos CP.Partially ordered preferences in decision trees:computing strategies with imprecision in probabilities.In:Brafman R,Junker U,eds.Proc.of Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling.Edinburgh,2005.118-123.http://wikix.ilog.fr/wiki/bin/view/Preference 05/WsProceedings
    [4]Hansson SO.Preference Logic in Handbook of Philosophical Logic.2nd ed.,Dordrecht:Kluwer Academic Publishers,2001.
    [5]von Wright GH.The logic of preference reconsidered.Theory and Decision,1972,3(2):140-169.
    [6]Kaci S,van der Torre L.Algorithms for a nonmonotonic logic of preferences.In:Godo L,ed.Proc.of the 8th European Conf.on Symbolic and Quantitative Approaches to Reasoning with Uncertainty.2005.281-292.http://agamemnon.uni.lu/ILIAS/ vandertorre/papers/ecsqaru05.pdf
    [7]Kaci S,van der Torre L.Non-Monotonic reasoning with various kinds of preferences.In:Brafman R,Junker U,eds.Proc of the Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling.2005.112-117.http://wikix.ilog.fr/wiki/bin/view/ Preference 05/WsProceedings
    [8]van Benthem J,van Otterloo S,Roy O.Preference logic,conditionals and solution concepts in games.In:Lagerlund H,Lindstr-m S,Sliwinski R,eds.Modality Matters:Twenty-Five Essays in Honour of Krister Segerberg.Uppsala:University of Uppsala,2006.61-76.
    [9]Brewka G.A rank based description language for qualitative preferences.In:Saitta L,ed.Proc.of the 16th European Conf.on Artificial Intelligence.Valencia:IOS Press,2004.303-307.
    [10]Lang J.Logic preference representation and combinatorial vote.Annals of Mathematics and Artificial Intelligence,2004,42(1-3):37-71.
    [11]Coste-Marquis S,Lang J,Liberatore P,Marquis P.Expressive power and succinctness of propositional languages for preference representation.In:Dubois D,Welty C,Williams MA,eds.Proc.of the 9th Int'l Conf.on Principles of Knowledge Representation and Reasoning (KR 2004).Menlo Park:AAAI Press,2004.203-212.
    [12]Doyle J,Wellman M.Representing preferences as ceteris paribus comparatives.In:Hanks S,Russel S,Wellman M,eds.Working Notes of the AAAI Spring Symp.on Decision-Theoretic Planning.Menlo Park:AAAI Press,1994.69-75. [1]分级知识库通常被看作是偏好的逻辑表示的主要方法[9-11].在分级知识库上实施不同的偏好策略,就能得到不同的偏好信息,所以从偏好表示的角度可以认为,不同的偏好策略表征了不同的偏好类型.
    [2]将ceteris paribus原则的"其他情况都相同"解释为上下文等价.设ξ(W)是W上的等价关系集,定义上下文等价函数η:P(P(W))→ξ(W),其中P()表示幂集,那么,η为每一个命题公式集都指派了一个等价关系.形式上,φ>ψ当且仅当对于(A)(w,w')∈η(φ∧┐ψ,┐φ∧ψ)如果w|=φ∧┐ψ且w'|≠φ∧ψ,那么w>w'.
    [3]在此,归结过程是在按顺序考察3种模式的基础上,尽量采用先得到结论推导后面模式的结论,然后把所有能用先前的结论推出的结论去掉,限于篇幅,这里不再赘述.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

张志政,邢汉承,王蓁蓁,倪庆剑.一种基于多类型偏好的偏好逻辑.软件学报,2007,18(11):2728-2739

复制
分享
文章指标
  • 点击次数:5241
  • 下载次数: 5361
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2006-12-10
  • 最后修改日期:2007-03-08
文章二维码
您是第19784094位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号