page 1  (13 pages)
2to next section

Technical Report TR-ARP-2-95

Automated Reasoning Project
Research School of Information Sciences and Engineering and Centre for Information Science Research
Australian National University

January 11, 1995


Greg Restall and John Slaney

Abstract In this paper we consider the implications for belief revision of weakening the logic under which belief sets are taken to be closed. A widely held view is that the usual belief revision functions are highly classical, especially in being driven by consistency. We show that, on the contrary, the standard representation theorems still hold for paraconsistent belief revision. Then we give conditions under which consistency is preserved by revisions, and we show that this modelling allows for the gradual revision of inconsistency.