A new one-pass and tree-shaped tableau system for satisfiability checking has been
recently proposed, where each branch can be explored independently from others and …

The paper presents Leviathan, an LTL satisfiability checking tool based on a novel one-
pass, tree-like tableau system, which is way simpler than existing solutions. Despite the …

We give an optimal (exptime), sound and complete tableau-based algorithm for deciding
satisfiability for propositional dynamic logic. Our main contribution is a sound method to track …

We present MLSolver, a tool for solving the satisfiability and validity problems for modal
fixpoint logics. The underlying technique is based on characterisations of satisfiability …

The completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-
constructive and usually presented in an informal manner. We obtain a formal and …

The main topic of this thesis concerns temporal logics, with particular attention to their
expressive power and to the satisfiability and realizability problems. Temporal logics are …

Timeline-based planning is an approach originally developed in the context of space
mission planning and scheduling, where problem domains are modelled as systems made …

We present the first terminating tableau system for hybrid logic with eventualities. The
system is designed as a basis for gracefully degrading reasoners. Eventualities are formulas …

An automatic theorem prover for a proof system in the style of dual tableaux for the relational
logic associated with modal logic has been introduced. Although there are many well-known …

Calculi for propositional dynamic logics have been investigated since the introduction of this
logic in the late seventies. Only in recent years have practical procedures been suggested …