scientific article; zbMATH DE number 1785000
Let \(K\) be a collection of data (which we call a theory) and \(\alpha\) a piece of information, then the AGM model characterizes three different kinds of theory change: expansion \((K + \alpha)\), where information is simply added to the theory, revision \((K \ast \alpha)\), where information is consistently added to the theory, and contraction \((K - \alpha)\), where information is eliminated from the theory. The aim of the paper is to define the simplest scheme of iteration (of each of the above mentioned operations) for AGM: iterable functions that are binary functions whose behaviour is specified for any theory \(K\) and formula \(\alpha\). For the entire collection see [Zbl 0982.00012].
- Shifting Priorities: Simple Representations for Twenty-Seven Iterated Theory Change Operators
- Belief revision against background knowledge
- Incompatibilities Between Iterated and Relevance-Sensitive Belief Revision
- AGM 25 years. Twenty-five years of research in belief change
- Mixed Iterated Revisions: Rationale, Algorithms, and Complexity
- Equilibria in social belief removal
- Representing states in iterated belief revision
- Dynamic belief revision operators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4546706)