
leanTAP
 Referenced in 34 articles
[sw09985]
 generalizes the sequent calculus to the modal logic K and sketches a proof ... theorem prover for the modal logic K which is as elegant as leanTAP. Following that ... results can be obtained for the modal logics T, K4 and S4. The paper ... extended to the case of quantified modal logics as long as the Barcan formula...

KLONE
 Referenced in 38 articles
[sw28891]
 closely related to propositional modal logics and logics of programs (such as propositional dynamic logic ... from runofthemill modal and program logics. Consequently, the research on tableau algorithms ... logics led to new techniques and results, which are, however, also of interest for modal ... that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors...

SQEMA
 Referenced in 34 articles
[sw03056]
 Algorithmic correspondence and completeness in modal logic. IV. Semantic extensions of SQEMA ... firstorder equivalents and proving canonicity of modal formulae, and thus established a very general...

ModLeanTAP
 Referenced in 17 articles
[sw12368]
 Lean Tableaubased Deduction for Propositional Modal Logics. ModLeanTAP is a lean Prolog implementation ... modular labelled tableau calculus for propositional modal logics (where the labels contain free and universal ... with other considerably more complex implementations for modal deduction. ModLeanTAP’s development was inspired ... lean tableaubased prover for firstorder logic leanTAP. ModLeanTAP Version 2.0 includes additional search...

CoLoSS
 Referenced in 13 articles
[sw07016]
 Solver CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic ... space algorithm to decide satisfiability for modal logics that are amenable to coalgebric semantics. This ... Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily integrated ... that include the fusion of two modal logics as a special case. One thus automatically...

TABLEAUX
 Referenced in 13 articles
[sw11674]
 TABLEAUX: A general theorem prover for modal logics. We present a general theorem proving system ... propositional modal logics, called TABLEAUX. The main feature of the system is its generality, since ... wide class of modal logics, including usual temporal, epistemic or dynamic logics. We survey ... such semantical proof methods for modal logics, since we believe that the model construction they...

MSPASS
 Referenced in 21 articles
[sw17667]
 which can be used as a modal logic theorem prover, a theorem prover for description...

Spartacus
 Referenced in 12 articles
[sw12426]
 tableau prover for hybrid multimodal logic with global modalities and reflexive and transitive relations. Spartacus ... lazy branching for the basic modal logic K and observe high effectiveness of both techniques...

QMLTP
 Referenced in 7 articles
[sw09915]
 QMLTP problem library for firstorder modal logics. The Quantified Modal Logic Theorem Proving (QMLTP ... proving (ATP) systems for firstorder modal logics. The main purpose of the library ... version 1.1 of the library the modal logics K, D, T, S4 and S5 with ... small number of problems for multimodal logic are included as well...

HTab
 Referenced in 10 articles
[sw12427]
 that is closely related to both modal logic and description logic. A variety of proof ... mechanisms for hybrid logic exist, but the only widely available implemented proof system, HyLoRes ... already widely used for both modal and description logics. Tableaux algorithms have also been developed...

Concurrency Workbench
 Referenced in 12 articles
[sw14749]
 preorders; define propositions in a powerful modal logic and check whether a given process satisfies...

LoTREC
 Referenced in 23 articles
[sw07684]
 LoTREC: Logical tableaux research engineering companion. In this paper we describe a generic tableaux system ... testing satisfiability of formulas in modal and description logics. This system is called LoTREC2.0...

MleanCoP
 Referenced in 6 articles
[sw21522]
 connection prover for firstorder modal logic. MleanCoP is a fully automated theorem prover ... firstorder modal logic. The proof search is based on a prefixed connection calculus ... captures the Kripke semantics of different modal logics. MleanCoP is implemented in Prolog ... lines. It supports the standard modal logics D, T, S4, and S5 with constant, cumulative...

MCMASSLK
 Referenced in 10 articles
[sw24778]
 labelling algorithm for epistemic and strategy logic modalities. We provide details of the checker which...

Cool
 Referenced in 4 articles
[sw11992]
 ontology logic solver Cool, a generic reasoner that decides the satisfiability of modal (and, more ... global assumptions – in description logic parlance, we support a general TBox and internalize a Boolean ... framework covering a wide range of modal logics, beyond relational semantics. The core of Cool ... relational examples as well as graded modal logic and Pauly’s coalition logic (the next...

MGTP
 Referenced in 6 articles
[sw09701]
 based theorem prover MGTP for firstorder logic. This paper describes the major results ... negation as failure, abductive reasoning and modal logic systems, on MGTP. These techniques share...

evt
 Referenced in 6 articles
[sw09805]
 formulated as behavioural properties in a modal logic with recursion. We give a summary...

STeLP
 Referenced in 9 articles
[sw09772]
 input a particular kind of logic program with modal operators (called Splitable Temporal Logic Program...

LWB
 Referenced in 3 articles
[sw01820]
 Relations between propositional normal modal logics: An overview. In this short paper the authors give ... most common propositional normal modal logics by first providing a catalogue of their axioms ... theorem prover for propositional modal and other nonclassical logics. A pleasant side effect of their ... performance of different theorem provers for modal logics...

Mechanized Semantic Library
 Referenced in 5 articles
[sw13123]
 useful for developing semantic models of program logics and type systems: separation algebras, permission share ... clean axiomatization of step indexing), and modal logics. The library has a special emphasis...