English
Related papers

Related papers: Categories for Dynamic Epistemic Logic

200 papers

The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which…

Logic in Computer Science · Computer Science 2014-12-09 Steffen Lewitzka

The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…

Category Theory · Mathematics 2018-08-21 Kumar Sankar Ray , Litan Kumar Das

This is the fourth (and last) prepublication version of a book on derived categories, that will be published by Cambridge University Press. The purpose of the book is to provide solid foundations for the theory of derived categories, and to…

Category Theory · Mathematics 2020-01-07 Amnon Yekutieli

Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…

Artificial Intelligence · Computer Science 2023-03-10 Marc Aiguier , Isabelle Bloch , Salim Nibouche , Ramon Pino Perez

The tractability of the lightweight description logic EL has allowed for the construction of large and widely used ontologies that support semantic interoperability. However, comprehensive domains with a broad user base are often at odds…

Artificial Intelligence · Computer Science 2023-05-11 Lucía Gómez Álvarez , Sebastian Rudolph , Hannes Strass

Skolemization, with Herbrand's theorem, underpins automated theorem proving and various transformations in computer science and mathematics. Skolemization removes strong quantifiers by introducing new function symbols, enabling efficient…

Logic in Computer Science · Computer Science 2025-01-28 Matthias Baaz , Mariami Gamsakhurdia , Rosalie Iemhoff , Raheleh Jalali

This paper is a submission to the contest: How to combine logics? at the World Congress and School on Universal Logic III, 2010. We claim that combining "things", whatever these things are, is made easier if these things can be seen as the…

Logic in Computer Science · Computer Science 2009-11-19 Dominique Duval

We extend symbolic model checking for Dynamic Epistemic Logic (DEL) with factual change. Our transformers provide a compact representation of action models with pre- and postconditions, for both S5 and the general case. The method can be…

Logic in Computer Science · Computer Science 2019-12-24 Malvin Gattinger

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…

Logic in Computer Science · Computer Science 2021-08-20 Jonne Iso-Tuisku , Antti Kuusisto

Model checking with the standard Kripke models used in (Dynamic) Epistemic Logic leads to scalability issues. Hence alternative representations have been developed, in particular symbolic structures based on Binary Decision Diagrams (BDDs)…

Logic in Computer Science · Computer Science 2025-12-01 Gregor Behnke , Malvin Gattinger , Avijeet Ghosh , Haitian Wang

The paper treats 4 different fragments of first-order logic induced by their respective versions of Kripke style semantics for modal intuitionistic logic. In order to capture these fragments, the notion of asimulation is modified and…

Logic · Mathematics 2018-02-01 Grigory Olkhovikov

We introduce syntactic modal operator $\BOX$ for \textit{being a thesis} into first-order logic. This logic is a modern realization of R. Carnap's old ideas on modality, as logical necessity (J. Symb. Logic, 1946) \cite{Ca46}. We place it…

Logic · Mathematics 2024-06-26 Marcin Łyczak

We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an…

Logic in Computer Science · Computer Science 2024-05-02 Ezra Schoen , Clemens Kupke , Jurriaan Rot , Ruben Turkenburg

Category theory is the language of homological algebra, allowing us to state broadly applicable theorems and results without needing to specify the details for every instance of analogous objects. However, authors often stray from the realm…

General Mathematics · Mathematics 2025-02-04 Skyler Marks

The categorical compositional approach to meaning has been successfully applied in natural language processing, outperforming other models in mainstream empirical language processing tasks. We show how this approach can be generalized to…

Logic in Computer Science · Computer Science 2017-10-02 Joe Bolt , Bob Coecke , Fabrizio Genovese , Martha Lewis , Dan Marsden , Robin Piedeleu

Our main goal is to give a sense of recent developments in the (stable) rationality problem from the point of view of unramified cohomology and 0-cycles as well as derived categories and semiorthogonal decompositions, and how these…

Algebraic Geometry · Mathematics 2020-08-03 Asher Auel , Marcello Bernardara

This paper introduces higher-order (``nested") Kripke models, a generalization of Kripke models that is remarkably close to Kripke's original idea -- both mathematically and conceptually. Standard models are now $0$-ary models, whereas…

Logic in Computer Science · Computer Science 2026-05-07 Victor Barroso-Nascimento

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

Where information grows abundant, attention becomes a scarce resource. As a result, agents must plan wisely how to allocate their attention in order to achieve epistemic efficiency. Here, we present a framework for multi-agent epistemic…

Artificial Intelligence · Computer Science 2021-05-24 Gaia Belardinelli , Rasmus K. Rendsvig

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco