Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Belief revision in a framework for default reasoning
Proceedings of the Workshop on The Logic of Theory Change
A Framework for Representing Knowledge
A Framework for Representing Knowledge
Revisions of knowledge systems using epistemic entrenchment
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Deductive Reasoning in the Structuralist Approach
Studia Logica
| Hi-index | 0.00 |
The present paper aims at a synthesis of belief revision theory with the Sneed formalism known as the structuralist theory of science. This synthesis is brought about by a dynamisation of classical structuralism, with an abductive inference rule and base generated revisions in the style of Rott (2001). The formalism of prioritised default logic (PDL) serves as the medium of the synthesis. Why seek to integrate the Sneed formalism into belief revision theory? With the hybrid system of the present investigation, a substantial simplification of the ranking information that is necessary to define revisions and contractions uniquely is achieved. This system is, furthermore, expressive enough to capture complex and non-trivial scientific examples. It is thus closely related to a novel research area within belief revision theory which addresses the dynamics of scientific knowledge.