Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Propositional knowledge base revision and minimal change
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
Infobase Change: A First Approximation
Journal of Logic, Language and Information
Semantic belief change
On the logic of iterated belief revision
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Managing theories of trust in agent based systems
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
| Hi-index | 0.00 |
Generalisations of theory change involving arbitrary sets of wffs instead of belief sets have become known as base change. In one view, a base should be thought of as providing more structure to its generated belief set, and can be used to determine the theory change operation associated with a base change operation. In this paper we extend a proposal along these lines by Meyer et al. [12]. We take an infobase as a finite sequence of wffs, with each element in the sequence being seen as an independently obtained bit of information, and define appropriate infobase change operations. The associated theory change operations satisfy the AGM postulates for theory change [1]. Since an infobase change operation produces a new infobase, it allows for iterated infobase change. We measure iterated infobase change against the postulates proposed by Darwiche et al. [2,3] and Lehmann [10].