Controlled revision - an algorithmic approach for belief revision


This paper provides algorithmic options for belief revision of a database receiving an infinite stream of inputs. At stage , the database is ¡£¢ , receiving the input ¤ ¢ . The revision algorithms for moving to the new database ¡ ¢¦¥¨§© ¡ ¢ ¤ ¢ 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.



    Upload a copy of this work     Papers currently archived: 86,554

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.


Added to PP

23 (#559,815)

6 months
2 (#525,456)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gabriella Pigozzi
Université Paris Dauphine