UNIFYING DEFAULT REASONING AND BELIEF REVISION IN A MODAL FRAMEWORK

被引:39
作者
BOUTILIER, C
机构
[1] Department of Computer Science, University of British Columbia, Vancouver
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1016/0004-3702(94)90095-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a logic for reasoning about belief revision in which the process of revising a knowledge base by some sentence is represented with a conditional connective. The conditional is not primitive however; it is defined in terms of two unary modal operators. We show that our notion of revision is equivalent to that determined by the classic AGM postulates. Furthermore, unlike current models of revision, our approach does not require the Limit Assumption. We also present a model for subjunctive query answering that allows the expression of subjunctive or factual premises, integrity constraints, and notions of entrenchment and plausibility. The modal framework we adopt is sufficiently general to allow the expression of other forms of defeasible reasoning, and facilitates the demonstration of some interesting connections between revision, default reasoning and autoepistemic logic. In particular, we show that the normative conditional for default reasoning (developed in a companion paper) and our subjunctive conditional are identical. Default reasoning can thus be viewed as the revision of a theory of expectations in manner that naturally relates priorities of default rules to the entrenchment of expectations.
引用
收藏
页码:33 / 85
页数:53
相关论文
共 55 条
[21]   BELIEF REVISIONS AND THE RAMSEY TEST FOR CONDITIONALS [J].
GARDENFORS, P .
PHILOSOPHICAL REVIEW, 1986, 95 (01) :81-93
[22]   EPISTEMIC IMPORTANCE AND MINIMAL CHANGES OF BELIEF [J].
GARDENFORS, P .
AUSTRALASIAN JOURNAL OF PHILOSOPHY, 1984, 62 (02) :136-157
[23]  
GARDENFORS P, 1988, 2ND P C THEOR ASP RE, P83
[24]  
GARDENFORS P, 1978, ACTA PHILOS FENN, V30, P381
[25]  
Gardenfors P., 1990, LOGIC THEORY CHANGE, P185
[26]  
GARDENFORS P, 1990, P 9 EUR C ART INT EC, P768
[27]  
Gardenfors Peter, 1988, KNOWLEDGE FLUX MODEL
[28]   COUNTERFACTUALS [J].
GINSBERG, ML .
ARTIFICIAL INTELLIGENCE, 1986, 30 (01) :35-79
[29]   ON THE CONSISTENCY OF DEFEASIBLE DATABASES [J].
GOLDSZMIDT, M ;
PEARL, J .
ARTIFICIAL INTELLIGENCE, 1991, 52 (02) :121-149
[30]  
GRAHNE G, 1991, P WORKSHOP NONSTANDA, V1, P33