Related papers: Categories for Dynamic Epistemic Logic
The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…
Given a class $\mathcal C$ of models, a binary relation ${\mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $\mathcal C$ in $L$ where the modal operator is…
We extend the use of ("Kripke-Joyal")- reasoning in categories admitting pull-backs. The aim is to give a theory of jets in this context.
Time series classification is a task of paramount importance, as this kind of data often arises in safety-critical applications. However, it is typically tackled with black-box deep learning methods, making it hard for humans to understand…
This article aims to present a neighborhood semantic for a modal logic, namely, propositional logic of the plausible. As a subnormal character modal logic, not admits a Kripke semantics. However, the authors show that this neighborhood…
In this article, we start with a two-player game that models communication under adverse circumstances in everyday life and study it from the perspective of a modal logic of graphs, where links can be deleted locally according to…
Previous research into the relation between ASP and classical logic has identified at least two different ways in which the former extends the latter. First, ASP program typically contain sets of rules that can be naturally interpreted as…
Modal logics are widely used in multi-agent systems to reason about actions, abilities, norms, or epistemic states. Combined with description logic languages, they are also a powerful tool to formalise modal aspects of ontology-based…
We investigate preservation results for the independent fusion of one-variable first-order modal logics. We show that, without equality, Kripke completeness and decidability of the global and local consequence relation are preserved, under…
"Natural languages are programming languages for minds." Can we or should we take this slogan seriously? If so, how? Can answers be found by looking at the various "dynamic" treatments of natural language developed over the last decade or…
We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging…
We develop a framework for epistemic logic that combines relevant modal logic with classical propositional logic. In our framework the agent is modeled as reasoning in accordance with a relevant modal logic while the propositional fragment…
RS-frames were introduced by Gehrke as relational semantics for substructural logics. They are two-sorted structures, based on RS-polarities with additional relations used to interpret modalities. We propose an intuitive, epistemic…
This paper presents meta-logical investigations based on category theory using the proof assistant Isabelle/HOL. We demonstrate the potential of a free logic based shallow semantic embedding of category theory by providing a formalization…
Traditionally, Epistemic Logic represents epistemic scenarios using a single model. This, however, covers only complete descriptions that specify truth values of all assertions. Indeed, many -- and perhaps most -- epistemic descriptions are…
We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…
We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…
The quest of smoothly combining logics so that connectives from classical and intuitionistic logics can co-exist in peace has been a fascinating topic of research for decades now. In 2015, Dag Prawitz proposed a natural deduction system for…
Stable model semantics has become a very popular approach for the management of negation in logic programming. This approach relies mainly on the closed world assumption to complete the available knowledge and its formulation has its basis…
Definite descriptions, such as 'the General Chair of KR 2024', are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for…