The tableau-like proof system KEM has been proven to be able to cope with a wide variety of (normal) modal logics. KEM is based on D'Agostino and Mondadori's (1994) classical proof system KE, a combination of tableau and natural deduction inference rules which allows for a restricted ("analytic") Use of the cut rule. The key feature of KEM, besides its being based neither on resolution nor on standard sequent/tableau inference techniques, is that it generates models and checks them using a label scheme to bookkeep "world" paths. This formalism can be extended to handle various system of multimodal logic devised for dealing with nonmonotonic reasoning, by relying in particular on Meyer and van der Hoek's (1992) logic for actuality and prefer...
AbstractIn this paper a new proof procedure for some propositional and first-order normal modal logi...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in...
In this paper we present a tableau-like proof system for multi-modal logics based on D'Agostino and ...
In this paper we show how to extend KEM, a tableaux-like proof system for normal modal logic, in ord...
We propose to extend description logic with defeasible rules, and to use the inferential mechanism o...
In this paper we describe an algorithmic framework for a multi-modal logic arising from the combinat...
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main ...
We describe a general and uniform tableau methodology for multi-modal logics arising from Gabbay's m...
In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibr...
We investigate the relative complexity of two free-variable labelled modal tableaux (KEM and Single ...
Nonmonotonic logics are usually characterized by the pres-ence of some notion of ‘conditional ’ that...
Abstract. In this paper we show how to extend KEM, a tableau-like proof system for normal modal logi...
AbstractWe present a decision procedure for hybrid logic equipped with nominals, the satisfaction op...
AbstractInspired by the recent work on approximations of classical logic, we present a method that a...
AbstractIn this paper a new proof procedure for some propositional and first-order normal modal logi...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in...
In this paper we present a tableau-like proof system for multi-modal logics based on D'Agostino and ...
In this paper we show how to extend KEM, a tableaux-like proof system for normal modal logic, in ord...
We propose to extend description logic with defeasible rules, and to use the inferential mechanism o...
In this paper we describe an algorithmic framework for a multi-modal logic arising from the combinat...
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main ...
We describe a general and uniform tableau methodology for multi-modal logics arising from Gabbay's m...
In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibr...
We investigate the relative complexity of two free-variable labelled modal tableaux (KEM and Single ...
Nonmonotonic logics are usually characterized by the pres-ence of some notion of ‘conditional ’ that...
Abstract. In this paper we show how to extend KEM, a tableau-like proof system for normal modal logi...
AbstractWe present a decision procedure for hybrid logic equipped with nominals, the satisfaction op...
AbstractInspired by the recent work on approximations of classical logic, we present a method that a...
AbstractIn this paper a new proof procedure for some propositional and first-order normal modal logi...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in...