期刊文献+

CP-nets的可满足性及一致性研究 被引量:7

On the Satisfiability and Consistency for CP-nets
在线阅读 下载PDF
导出
摘要 CP-nets是一种简单而又直观的图形化偏好表示工具,成为近几年人工智能的一个研究热点,然而对于CP-nets的可满足性和一致性等相关性质的研究还很欠缺.既没有给出严格的定义,也没有探讨不同性质之间的联系,没有一个求可满足性序列的通用算法.从研究CP-nets的可满足性和一致性的关系着手,得出了任意结构二值CP-nets的可满足性判定算法及可满足性序列生成算法.首先通过构造CP-nets导出图及其性质的研究,得出CP-nets的可满足性及一致性的相关定理.再把不同性质结合起来分析,给出CP-nets可满足性等价于一致性的结论,从而利用拓扑排序的思想实现了任意结构二值CP-nets的可满足性序列的生成.强化和扩充了Boutilier所提出的一些概念,深化了CP-nets的基础理论研究. The conditional preference networks(CP-nets) is a simple and intuitive graphical tool for representing conditional ceteris paribus(all else being equal) preference statements over the values of a set of variables,which has become a research hotspot in artificial intelligence field recently.However,by now there are few works to address its characteristics of satisfiability and consistency,and there are neither strict definition of them,further discussion of their relationships,nor a general algorithm to get a satisfactory ranking.By analyzing the relationships between satisfiability and consistency,two algorithms are proposed to judge the satisfiability and to generate the satisfactory ranking for any structured binary-valued CP-nets.Firstly,by constructing an induced graph of CP-nets and studying its properties,the related theorems on satisfiability and consistency are obtained.Secondly,by analyzing the relations between them,a conclusion is drawn that the satisfiability for CP-nets is equivalent to its consistency.Therefore,the satisfactory ranking for any structured binary-valued CP-nets can be generated with the method of topology sort.What's more,the syntax,semantics and some definitions of CP-nets are collated and introduced.All these studies can be seen as the improvement and refinement of Boutilier's related works,and can deepen the basic theory research of CP-nets.
出处 《计算机研究与发展》 EI CSCD 北大核心 2012年第4期754-762,共9页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61170224)
关键词 条件偏好网 条件偏好表 偏好的可满足性 可满足性序列 偏好的一致性 CP-nets导出图 condition preference networks(CP-nets) condition preference table(CPT) preference satisfiability satisfactory ranking preference consistency induced graph of CP-nets
作者简介 孙雪姣,Sun Xuejiao,born in 1979.Master and lecturer.Her main research interests include technology of Web searching,sunxuejiao6@tom.com;刘惊雷,born in 1970.Master and associate professor.Member of China Computer Federation.His main research directions are program theory and comput-ational method,jinglei_liu@sina.com.
  • 相关文献

参考文献13

  • 1Brafman R,Domshlak C. Preference handling-An introductory tutorial[J].AI Magazine,2009,(01):58-86.
  • 2Boutilier C,Brafman R,Domshlak C. CP-nets:A tool for representing and reasoning with conditional ceteris paribus statements[J].Journal of Artificial Intelligence Research,2004,(01):135-191.
  • 3Koriche F,Zanuttini B. Learning conditional preference networks with queries[A].San Francisco:Morgan Kaufmann Publishers,2009.1930-1935.
  • 4Koriche F,Zanuttini B. Learning conditional preference networks[J].Artificial Intelligence,2010,(11):685-703.doi:10.1016/j.artint.2010.04.019.
  • 5刘惊雷.CP-nets及其表达能力研究[J].自动化学报,2011,37(3):290-302. 被引量:17
  • 6Goldsmith J,Lang J,Truszczynski M. The computational complexity of dominance and consistency in CP-nets[J].Journal of Artificial Intelligence Research,2008,(01):403-432.
  • 7Brafman R,Domshlak C,Shimony E. On graphical modeling of preference and importance[J].Journal of Artificial Intelligence Research,2006,(01):389-424.
  • 8Bouveret S,Endriss U,Lang J. Conditional importance networks:A graphical language for representing ordinal,monotonic preferences over sets of goods[A].San Francisco:Morgan Kaufmann Publishers,2009.67-72.
  • 9Lang J,Mengin J. The complexity of learning ceteris paribus separable preferences[A].San Francisco:Morgan Kaufmann Publishers,2009.848-853.
  • 10Sun Xuejiao,Liu Jinglei. Representation and realization of binary-valued CP-nets in single-branch tree[A].Piscataway,NJ:IEEE,2010.1908-1911.

二级参考文献4

共引文献16

同被引文献28

  • 1杨帆,郑建武,刘明生.随机性及其应用研究[J].计算机系统应用,2007,16(2):18-20. 被引量:2
  • 2Boutilier C,Brafman R,Domshlak C. CP-nets:a tool for representing and reasoning with conditional ceteris paribus statements[J].Journal of Artificial Intelligence Research,2004.135-191.
  • 3Brafman R,Domshlak C. Preference Handling--An Introductory Tutorial[J].AI Magazine,2009,(01):58-86.
  • 4Goldsmith J,Lang J,Truszczynski M. The computational complexity of dominance and consistency in CP-nets[J].Journal of Artificial Intelligence Research,2008,(01):403-432.
  • 5Brafman R,Domshlak C,Shimony E. On graphical modeling of preference and importance[J].Journal of Artificial Intelligence Research,2006.389-424.
  • 6Bouveret S,Endriss U,Lang J. Conditional Importance Networks:A Graphical Language for Representing Ordinal,Monotonic Preferences over Sets of Goods[A].San Francisco,USA:Morgan Kaufmann Publishers,2009.67-72.
  • 7Lang J,Mengin J. The complexity of learning ceteris paribus separable preferences[A].San Francisco,USA:Morgan Kaufmann Publishers,2009.848-853.
  • 8Sun Xue-jiao,Liu Jing-lei. Representation and Realization of Binary-valued CP-nets in Single-Branch Tree[A].Yantai,China:IEEE,2010.1908-1911.
  • 9Sun Xue-jiao,Liu Jing-lei. Representation and Realization of Binary-valued CP-nets in Directed Tree[A].Yantai,China:IEEE,2010.2941-2944.
  • 10陈守孔;孟佳娜;武秀川.算法与数据结构(第2版)[M]北京:机械工业出版社,2008128-147.

引证文献7

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部