In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke...
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...