Results 1  10
of
365,026
Free Variable Tableaux for Propositional Modal Logics
 TABLEAUX97, LNCS 1227
, 1997
"... We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain "free" and "universal" variables. Our "lean" Prolog implementation is not only surprisingly short, but compares favourably with other co ..."
Abstract

Cited by 45 (5 self)
 Add to MetaCart
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain "free" and "universal" variables. Our "lean" Prolog implementation is not only surprisingly short, but compares favourably with other
Freevariable tableaux for propositional modal logics
 Studia Logica
"... Abstract. Freevariable semantic tableaux are a wellestablished technique for firstorder theorem proving where free variables act as a metalinguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional m ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
modal logics, including nontrivial rigorous proofs of soundness and completeness, and also present various techniques that improve the efficiency of the basic naive method for such tableaux.
A Propositional Modal Logic of Time Intervals
 Journal of the ACM
, 1996
"... : In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this end we develop a modal temporal logic based on time intervals, a logic which can be viewed as a gener ..."
Abstract

Cited by 162 (2 self)
 Add to MetaCart
: In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this end we develop a modal temporal logic based on time intervals, a logic which can be viewed as a
Labelled Propositional Modal Logics: Theory and Practice
, 1996
"... We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and wellknown class of propositional modal logics (including K, D, T , B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base lo ..."
Abstract

Cited by 40 (8 self)
 Add to MetaCart
We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and wellknown class of propositional modal logics (including K, D, T , B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base
A Philosophical Conception of Propositional Modal Logic
"... this paper were conceived while writing the first chapter of an introductory text in modal logic (in progress). I would like to thank Bernie Linsky, Greg O'Hair, John Etchemendy, Chris Menzel, Kees van Deemter, Johan van Benthem, Uwe Monnich, and Tony Anderson for their insightful contributions ..."
Abstract
 Add to MetaCart
this paper were conceived while writing the first chapter of an introductory text in modal logic (in progress). I would like to thank Bernie Linsky, Greg O'Hair, John Etchemendy, Chris Menzel, Kees van Deemter, Johan van Benthem, Uwe Monnich, and Tony Anderson for their insightful
Semianalytic Tableaux For Propositional Modal Logics of Nonmonotonicity
, 1993
"... The propositional monotonic modal logics K45, K45D, S4:2, S4R and S4F elegantly capture the semantics of many current nonmonotonic formalisms as long as (strong) deducibility of A from a theory \Gamma; \Gamma ` A; allows the use of necessitation on the members of \Gamma: This is usually forbidden ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The propositional monotonic modal logics K45, K45D, S4:2, S4R and S4F elegantly capture the semantics of many current nonmonotonic formalisms as long as (strong) deducibility of A from a theory \Gamma; \Gamma ` A; allows the use of necessitation on the members of \Gamma: This is usually
Representation and Reduction of Decision System Based on Semantics of Extended Propositional Modal Logic
"... To direct at the characteristic of the decision system based on Rough set theory, the proposition modal logic is extended by adding the attribute constants as the basic symbols, and the formal system of the extended propositional modal logic as well as its semantics are described. Since every decisi ..."
Abstract
 Add to MetaCart
To direct at the characteristic of the decision system based on Rough set theory, the proposition modal logic is extended by adding the attribute constants as the basic symbols, and the formal system of the extended propositional modal logic as well as its semantics are described. Since every
A Benchmark Method for the Propositional Modal Logics K, KT, S4
, 1996
"... A lot of methods have been proposed (and sometimes implemented) for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of these methods in practice, since mostly only the execution times for a few simple formulas have been published. We try to imp ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
A lot of methods have been proposed (and sometimes implemented) for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of these methods in practice, since mostly only the execution times for a few simple formulas have been published. We try
Propositional Modal Logic: a Selection of its Properties, Applications, and Problems
"... Propositional modal logic is a conservative extension of classical propositional logic. It introduces at least one new unary sentential operator into the language. The typical example is the operator read as ‘it is necessary that ’ and its dual ¬¬, abbreviated as ◊ and read as ‘it is possible that’ ..."
Abstract
 Add to MetaCart
Propositional modal logic is a conservative extension of classical propositional logic. It introduces at least one new unary sentential operator into the language. The typical example is the operator read as ‘it is necessary that ’ and its dual ¬¬, abbreviated as ◊ and read as ‘it is possible that
Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics
, 1997
"... . This work is a study of the intertranslatability of two closely related proof methods, i.e. tableau (or sequent) and connection based, in the case of the propositional modal logics K, K4, T, S4, paying particular attention to the relation between matrix multiplicity and multiple use of 0formula ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. This work is a study of the intertranslatability of two closely related proof methods, i.e. tableau (or sequent) and connection based, in the case of the propositional modal logics K, K4, T, S4, paying particular attention to the relation between matrix multiplicity and multiple use of 0
Results 1  10
of
365,026