Belief RevisionPeter Gärdenfors Belief revision is a topic of much interest in theoretical computer science and logic, and it forms a central problem in research into artificial intelligence. In simple terms: how do you update a database of knowledge in the light of new information? What if the new information is in conflict with something that was previously held to be true? An intelligent system should be able to accommodate all such cases. This book contains a collection of research articles on belief revision that are completely up to date and an introductory chapter that presents a survey of current research in the area and the fundamentals of the theory. Thus this volume will be useful as a textbook on belief revision. |
Contents
An Introduction | 1 |
Foundations versus coherence theories | 29 |
Syntaxbased approaches to belief revision | 52 |
A dyadic representation of belief | 89 |
more maps between different kinds of contraction function | 122 |
Belief change and possibility theory | 142 |
Other editions - View all
Common terms and phrases
actor agent AGM postulates Alchourrón Artificial Intelligence assume assumptions belief base belief change belief revision belief set Cn(K Cn(Ø coherence approach conditional logic consistent contraction and revision contraction function contradiction database David Makinson defined definition denote derived disjunction Doyle DPM dynamics E-relation element epistemic entrenchment epistemic relevance ordering equivalent erasure example expansion finite follows foundations approach Gärdenfors 1988 Harman Hence hierarchy implies inconsistent intuitively K,Cn knowledge base knowledge representation lemma logic of theory minimal change modus ponens Nebel nonmonotonic notion partial meet contraction Peter Gärdenfors possibilistic possibility distribution possibility theory possible worlds postcondition preferred prioritized base revision Proof properties propositional propositional logic Ramsey test reason maintenance reasoning about action relation result revision function revision operation safe contractions satisfies selection function set of sentences Spohn's Suppose theorem theory change Touretzky update operator Winslett