Coalgebraic modal logic serves as a unifying framework to study a wide range of modal logics beyond the relational realm, including probabilistic and graded logics as well as conditional logics and logics based on neighbourhoods and games. Coalgebraic predicate logic (CPL), a generalization of a neighbourhoodbased first-order logic introduced by Chang, has been identified as a natural first-ord...

First-order modal logics have many applications, e.g. in planning and program verification. Whereas comprehensive and standardized problem libraries exist for, e.g., classical (TPTP library) and intuitionistic (ILTP library) logic, nothing comparable is so far available for firstorder modal logics. The aim of the Quantified Modal Logic Theorem Proving (QMLTP) library is to close this gap by pro...

This paper presents the modal interface theory, a unification of interface automata and modal specifications, two radically dissimilar models for interface theories. Interface automata is a game-based model, which allows the designer to express assumptions on the environment and which uses an optimistic view of composition: two components can be composed if there is an environment where they ca...

Multi-modal pedestrian detection, which integrates visible and thermal sensors, has been developed to overcome many limitations of visible-modal such as poor illumination, cluttered background, occlusion. By adopting the combination multiple modalities, we can efficiently detect pedestrians even with visibility. Nevertheless, critical assumption multi-modal detection is that images are perfectl...

Jaśkowski’s logic D2 was formulated with the help of the modal logic S5, [8]–[10]. It was shown (see [12], [16]) that to define D2 one could use normal modal logics weaker than S5. In the present paper we indicate a certain regular modal logic which also defines D2. This logic is the weakest regular modal logic defining D2.

In this paper, we prove that the variety of modal FLew-algebras is generated by its finite simple members. The result is obtained by showing that every free modal FLew-algebra is semisimple and then showing that every variety generated by a simple modal FLew-algebra is generated by a set of finite simple modal FLew-algebras.

4 The Modal Logic S4 7 4.1 Kripke Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Modal Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Algebraic Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Power-Set Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.5 Mappi...

We investigate a simple modal logic of probability with a unary modal operator expressing that a proposition is more probable than its negation. Such an operator is not closed under conjunction, and its modal logic is therefore non-normal. Within this framework we study the relation of probability with other modal concepts: belief and action.

In [H1], we develop a fixpoint semantics, the least model semantics, and an SLDresolution calculus in a direct way for positive modal logic programs in basic serial monomodal logics. In [H2], we extend the results and generalize the methods of [H1] for multimodal logics, giving a framework for developing semantics for positive logic programs in serial multimodal logics. In [H3], we report on ou...