Algorithmic context revision

Abstract

In Chapter 3, we provided a number of operations for belief change. The revision operator was then used to analyse the process of iteration in Chapter 4, making use of the fact that consecutive inputs to a database (belief base) naturally give rise to a linear order on the beliefs in that database. We dropped the linearity restriction in Chapter 5 and considered alternatives for dealing with the extra structure available in the database. However, in all of the above, we have not looked into (or attempted to modify) the particular characteristics of the logic L used for the reasoning, apart from the obvious considerations on consistency of the database itself. © 2010 Springer-Verlag Berlin Heidelberg.