Abstract

In his article "Reassurance via Translation" Marcel Crabbe proposed a formalism to obtain reassurance and classical recapture in the setting of minimal FDE. His formalism proved to be general enough to be extended in order to formalize other forms of non-monotonic systems based on preference relations. It is the aim of this article to show how his result can be extended in a natural way by combining two different reasoning systems, namely minimal FDE and circumscription, in order to get a paraconsistent and paracomplete version of circumscription, which we will call paracomplistent circumscription, which has the advantages of FDE and circumscription but is neither explosive nor lacks modus ponens in consistent contexts. Furthermore, we will complete a proof Crabbe left unfinished.