The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate ...
DLP (Description Logic Prover) is an experimental description logic knowledge representation system. DLP currently implements a superset of propositional dynamic logic as well as ...