Revision in extended propositional calculus

被引:0
作者
Papini, O [1 ]
Rauzy, A [1 ]
机构
[1] UNIV BORDEAUX 1, LABRI, F-33405 TALENCE, FRANCE
来源
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING AND UNCERTAINTY | 1995年 / 946卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose a new modality, denoted by b, which allow preferences in propositional knowledge bases. Formulae with b are interpreted in a weighted propositional calculus, This new modality can be used in order to define a revision operator that satisfy Alchouron, Gardenfors and Makinson postulates modified by Katsuno et Mendelzon.
引用
收藏
页码:328 / 335
页数:8
相关论文
共 9 条
[1]   ON THE LOGIC OF THEORY CHANGE - PARTIAL MEET CONTRACTION AND REVISION FUNCTIONS [J].
ALCHOURRON, CE ;
GARDENFORS, P ;
MAKINSON, D .
JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (02) :510-530
[2]  
BORDIGA A, 1985, ACM T DATABASE SYSTE, V10
[3]  
Dalal M., 1988, P 7 NAT C ART INT AA, P475
[4]  
GARDENFORS, 1988, KNOWLEDGE FLUX MODEL
[5]   LINEAR LOGIC [J].
GIRARD, JY .
THEORETICAL COMPUTER SCIENCE, 1987, 50 (01) :1-102
[6]   PROPOSITIONAL KNOWLEDGE BASE REVISION AND MINIMAL CHANGE [J].
KATSUNO, H ;
MENDELZON, AO .
ARTIFICIAL INTELLIGENCE, 1991, 52 (03) :263-294
[7]  
PAPINI O, 1993, LNCS, V747, P296
[8]  
VONWRIGHT GH, 1965, ACTA PHILOS FENN FAS, V18, P297
[9]  
Winslett M., 1988, 7TH P NAT US C ART I, P89