Comparing and Weakening Possibilistic Knowledge Bases

被引:1
作者
Bouzar-Benlabiod, Lydia [1 ,2 ]
Benferhat, Salem [1 ]
Bouabana-Tebibel, Thouraya [2 ]
机构
[1] Univ Artois, CNRS, CRIL, Lens, France
[2] Ecole Natl Super Informat ESI, LCSI Lab, Algiers, Algeria
关键词
Forgetting variables; possibilistic logic; possibilistic knowledge bases; specificity relation; SPECIFICITY; INFORMATION;
D O I
10.1142/S0218488514500081
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Weighted logics are important tools for reasoning under uncertain knowledge. A weighted knowledge base is a set of weighted formulas of the form (phi(i),alpha(i)) where phi(i) is a propositional formula and alpha(i) is the certainty degree associated with phi(i). This paper addresses two issues in the possibility theory framework: i) how to compare two weighted knowledge bases with respect to their information contents ? and ii) how to syntactically define the concept of forgetting variables ? We show that comparing knowledge bases is the counterpart of the concept of the specificity relation defined between possibility distributions.
引用
收藏
页码:181 / 203
页数:23
相关论文
共 44 条
  • [1] [Anonymous], P 12 INT JOINT C ART
  • [2] [Anonymous], 2011, P 22 INT JOINT C ART
  • [3] [Anonymous], KR 2000 PRINC KNOWL
  • [4] [Anonymous], ECAI 2012 WORKSH WEI
  • [5] [Anonymous], IJCAI 2013
  • [6] [Anonymous], 2011, IJCAI 2011 P 22 INT
  • [7] [Anonymous], 1988, Possibility Theory
  • [8] [Anonymous], P 10 C UNC ART INT U
  • [9] [Anonymous], FDN PROBABILITY TH A
  • [10] [Anonymous], 1994, Handbook of Logic in Artificial Intelligence and Logic Programming. Ed. by