Controlled revision - An algorithmic approach for belief revision

D Gabbay, G Pigozzi, J Woods

Research output: Contribution to journalConference paper

27 Citations (Scopus)


This paper provides algorithmic options for belief revision of a database receiving an infinite stream of inputs. At stage n, the database is Delta(n), receiving the input A(n). The revision algorithms for moving to the new database Delta(n+1) = Delta(n) x A(n) 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.
Original languageEnglish
Pages (from-to)15 - 35
Number of pages21
JournalJournal of Logic and Computation
Issue number1
Publication statusPublished - Feb 2003
Event3rd Annual De Morgan Conference on Applied Logic - LONDON, ENGLAND
Duration: 1 Jan 2003 → …


Dive into the research topics of 'Controlled revision - An algorithmic approach for belief revision'. Together they form a unique fingerprint.

Cite this