Related papers: Characterising Modal Formulas with Examples
We study the problem of finite ontology mediated query answering (FOMQA), the variant of OMQA where the represented world is assumed to be finite, and thus only finite models of the ontology are considered. We adopt the most typical setting…
Multimodal learning leverages the integration of diverse data modalities to enhance performance in complex tasks. Yet, it frequently encounters incomplete or redundant modality data in real-world scenarios. This paper presents a…
Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal,…
Logic has proved essential for formally modeling software based systems. Such formal descriptions, frequently called specifications, have served not only as requirements documentation and formalisation, but also for providing the…
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameter-free admissibility and unification to the setting with…
Affine term structure models have gained significant attention in the finance literature, mainly due to their analytical tractability and statistical flexibility. The aim of this article is to present both theoretical foundations as well as…
A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…
We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary…
We introduce simulations for modal logics with subclassical negations and restoration modalities, establish an adequacy theorem, and prove intrinsic (Hennessy-Milner-type) and relative (Van Benthem-type) characterization results. These…
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new…
We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…
In this paper, we study logics of bounded distributive residuated lattices with modal operators considering $\Box$ and $\Diamond$ in a noncommutative setting. We introduce relational semantics for such substructural modal logics. We prove…
A fine moduli space is constructed, for cyclic-by-$\mathsf{p}$ covers of an affine curve over an algebraically closed field $k$ of characteristic $\mathsf{p}>0$. An intersection of finitely many fine moduli spaces for cyclic-by-$\mathsf{p}$…
A normal modal logic is pretransitive, if the modality corresponding to the transitive closure of an accessibility relation is expressible in it. In the present work we establish the finite model property for pretransitive generalizations…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
Motivic local systems over a curve in finite characteristic form a countable set endowed with an action of the absolute Galois group of rational numbers commuting with the Frobenius map. I will discuss three series of conjectures about such…
This paper deals with the problem of recognizability of functions l: Sigma* --> M that map words to values in the support set M of a monoid (M,.,1). These functions are called M-languages. M-languages are studied from the aspect of their…
We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite pi-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
This paper studies the complexity of determining whether a formula in the modal logics characterizing the nested-simulation semantics is characteristic for some process, which is equivalent to determining whether the formula is satisfiable…