This paper provides algorithmic options for belief revision of a database receiving an infinite stream of inputs. At stage n, the database is Δn, receiving the input An. The revision algorithms for moving to the new database Δn+1 = Δn ⊗ An take into account the history of previous revisions actually executed as well as possible revision options which were discarded at the time but may now be pursued. The appropriate methodology for carrying this out is Labelled Deductive Systems.
|Number of pages||21|
|Journal||Journal of Logic and Computation|
|State||Published - Feb 2003|