We show that modal logics characterized by a class of frames satisfying the insertion property are suitable for Reiter's default logic. We refine the canonical fix point construction defined by Marek, Schwarz and Truszczyński for Reiter's default logic and thus we addrress a new paradigm for nonmonotonic logic. In fact, differently from the construction defined by these authors. we show that suitable modal logics for such a construction must indeed contain K D4. When reflexivity is added to the modal logic (...) used for the fix point construction then we come to the Marek Schwarz and Truszczyński framework for Reiter's default logic. Our framework, in fact, is appropriate also to the family of modal logics in between S4 and S4f. If, instead, reflexivity is dropped, then we show that a new family of modal logics is gained, namely the modal logics in between KD4 and KD4Z. The upper bound can be extended to the modal logic KD4LZ whenever the propositional language taken into account is finite. (shrink)
In this paper we address the problem of combining a logic with nonmonotonic modal logic. In particular we study the intuitionistic case. We start from a formal analysis of the notion of intuitionistic consistency via the sequent calculus. The epistemic operator M is interpreted as the consistency operator of intuitionistic logic by introducing intuitionistic stable sets. On the basis of a bimodal structure we also provide a semantics for intuitionistic stable sets.
Since the earliest formalisation of default logic by Reiter many contributions to this appealing approach to nonmonotonic reasoning have been given. The different formalisations are here presented in a general framework that gathers the basic notions, concepts and constructions underlying default logic. Our view is to interpret defaults as special rules that impose a restriction on the juxtaposition of monotonic Hubert-style proofs of a given logicL. We propose to describe default logic as a logic where the juxtaposition of default proofs (...) is subordinate to a restriction condition . Hence a default logic is a pair (L, ) where properties of the logic , like compactness, can be interpreted through the restriction condition . Different default systems are then given a common characterization through a specific condition on the logicL. We also prove cumulativity for any default logic (L, ) by slightly modifying the notion of default proof. We extend, in fact, the language ofL in a way close to that followed by Brewka in the formulation of his cumulative default system. Finally we show the existence of infinitely many intermediary default logics, depending on and called linear logics, which lie between Reiter's and ukaszewicz' versions of default logic. (shrink)