Skip Navigation



Journal of Logic and Computation Advance Access published online on April 10, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exm094
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jin, Y.
Right arrow Articles by Thielscher, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Reinforcement Belief Revision

Yi Jin

School of Computing Science, Simon Fraser University, Burnaby, Canada E-mail: yij{at}cs.sfu.ca

Michael Thielscher

Department of Computer Science, Dresden University of Technology, Dresden, Germany E-mail: mit{at}inf.tu-dresden.de


  Abstract

The capability of revising its beliefs upon new information in a rational and efficient way is crucial for an intelligent agent. The classical work in belief revision focuses on idealized models and is not concerned with computational aspects. In particular, many researchers are interested in the logical properties (e.g. the AGM postulates) that a rational revision operator should possess. For the implementation of belief revision, however, one has to consider that any realistic agent is a finite being and that calculations take time. In this article, we introduce a new operation for revising beliefs which we call reinforcement belief revision. The computational model for this operation allows us to assess it in terms of time and space consumption. Moreover, the operation is proved equivalent to a (semantical) model based on the concept of possible worlds, which facilitates showing that reinforcement belief revision satisfies all desirable rationality postulates.

Keywords: Iterated belief revision; computational revision operators; reinforcement effect; implicit dependence; possibilistic logic


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.