We perform a comprehensive experimental evaluation of off-the-shelf solvers for satisfiability
of propositional LTL. We consider a wide range of solvers implementing three major classes …

Spartacus is a tableau prover for hybrid multimodal logic with global modalities and reflexive
and transitive relations. Spartacus is the first system to use pattern-based blocking for …

We introduce a tableau decision method for deciding realizability of specifications
expressed in a safety fragment of LTL that includes bounded future temporal operators …

We present a simple E xp T ime (complexity-optimal) tableau decision procedure based on
and-or graphs with sound global caching for checking satisfiability of a concept wrt a TBox in …

We define an infinitary labelled sequent calculus for PDL, G3PDL^ ∞. A finitarily
representable cyclic system, G3PDL^ ω, is then given. We show that both are sound and …

We give an optimal (exptime), sound and complete tableau-based algorithm for deciding
satisfiability for propositional dynamic logic with converse (CPDL) which does not require …

We compare implementations of five theorem provers for Computation Tree Logic (CTL)
based on tree-tableaux, graph-tableaux, binary decision diagrams, resolution and games …

We present a logic approach to reason with moving objects under fuzzy qualitative
representation. This way, we can deal both with qualitative and quantitative information, and …

This thesis is about the proof theory of modal fixed point logics. In this introduction we shall
give an informal introduction to this topic. Moreover, we will describe the particular goals of …

Over the last forty years, computer scientists have invented or borrowed numerous logics for
reasoning about digital systems. Here, I would like to concentrate on three of them: Linear …