In this paper we describe the implementation of, a resolution-based prover for the basic
multimodal logic K _ n^ K n. The prover implements a resolution-based calculus for both …

In this paper, we describe an implementation of a hyper-resolution-based calculus for the
propositional basic multimodal logic,. The prover was designed to support experimentation …

We present a clausal resolution-based method for normal modal logics. Differently from
other approaches, where inference rules are based on the syntax of a particular set of …

We are interested in widening the reasoning support for propositional modal logics in the so-
called modal cube. The modal cube consists of extensions of the basic modal logic K with an …

Petri Nets are a widely used formalism to deal with concurrent systems. Dynamic Logics
(DL) are a family of modal logics where each modality corresponds to a program. This works …

Petri Nets are a widely used formalism to deal with concurrent systems. Dynamic Logics
(DLs) are a family of modal logics where each modality corresponds to a program. Petri-PDL …

The method of connecting logics has gained a lot of attention in the knowledge
representation and ontology communities because of its intuitive semantics and natural …

We consider the transformation of propositional linear time temporal logic formulae into a
clause normal form, called Separated Normal Form, suitable for resolution calculi. In …

We present a clausal resolution-based method for normal multimodal logics of confluence,
whose Kripke semantics are based on frames characterised by appropriate instances of the …

In this paper we describe the implementation of [inline-graphic not available: see fulltext], a
resolution-based prover for the basic multimodal logic K n. The prover implements a …