EPISTEMIC ENTRENCHMENT AND POSSIBILISTIC LOGIC

被引:101
作者
DUBOIS, D
PRADE, H
机构
[1] Institut de Recherche en Informatique de Toulouse, Université Paul Sabatier, 31062 Toulouse Cédex
关键词
Artificial Intelligence;
D O I
10.1016/0004-3702(91)90101-O
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This note points out the close relationships existing between recent proposals in the theory of belief revision made by Gardenfors based on the notion of epistemic entrenchment, and possibility theory applied to automated reasoning under uncertainty. It is claimed that the only numerical counterparts of epistemic entrenchment relations are so-called necessity measures that are dual to possibility measures, and are also mathematically equivalent to consonant belief functions in the sense of Shafer. Relationships between Spohn's ordinal conditional functions and possibility theory are also laid bare.
引用
收藏
页码:223 / 239
页数:17
相关论文
共 18 条
[1]   NECESSITY MEASURES AND THE RESOLUTION PRINCIPLE [J].
DUBOIS, D ;
PRADE, H .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1987, 17 (03) :474-478
[2]  
Dubois D., 1990, International Journal of Approximate Reasoning, V4, P1, DOI 10.1016/0888-613X(90)90006-N
[3]  
Dubois D., 1988, Computational Intelligence, V4, P244, DOI 10.1111/j.1467-8640.1988.tb00279.x
[4]  
DUBOIS D, 1986, COMPUT ARTIF INTELL, V5, P403
[5]  
Dubois D., 1988, NONSTANDARD LOGICS A, P287
[6]  
Dubois D., 1988, DECISION RISK RATION, P601
[7]  
Dubois D., 1988, POSSIBILITY THEORY
[8]  
DUBOIS D, 1989, 5TH P WORKSH UNC ART, P81
[9]  
DUBOIS D, 1987, 10TH P INT JOINT C A, P984
[10]  
GARDENFORS P, 1988, 2ND P C THEOR ASP RE, P83