English
Related papers

Related papers: A Characterization Theorem for a Modal Description…

200 papers

In this paper we study the expressive power and definability for (extended) modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt-Thomason…

Logic · Mathematics 2007-05-23 Balder ten Cate , David Gabelaia , Dmitry Sustretov

Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks. In this logic, the agent's knowledge is captured by modal epistemic operators whereas the system…

Artificial Intelligence · Computer Science 2019-05-28 Pedro Cabalar , Jorge Fandinno , Luis Fariñas del Cerro

A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic.…

Artificial Intelligence · Computer Science 2020-10-05 Sebastian Reiche , Christoph Benzmüller

In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

This paper is a mathematical investigation on Epstein semantics. One of the main tools of the present paper is the model-theoretic S-set construction introduced in (Krawczyk 2022). We use it to prove several results: 1) that each Epstein…

Logic · Mathematics 2025-06-09 Krzysztof A. Krawczyk

Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the…

Artificial Intelligence · Computer Science 2017-07-28 Yanjing Wang

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

The Alexandrov topology affords a well-known semantics of modal necessity and possibility. This paper develops an Alexandrov topological semantics of intuitionistic propositional modal logic internally in any elementary topos. This is done…

Category Theory · Mathematics 2024-10-18 Michael J. Lambert

Formal properties represent a cornerstone of the system-correctness proofs based on formal verification techniques such as model checking. Formalizing requirements into temporal properties may be very complex and error prone, due not only…

Logic in Computer Science · Computer Science 2017-09-08 Stefano Tonetta

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for…

Logic in Computer Science · Computer Science 2020-09-29 Leonard Botha , Thomas Meyer , Rafael Peñaloza

This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as "knowing whether", "knowing what", "knowing how" are frequently and widely used in everyday life as well as academic fields. In…

Logic in Computer Science · Computer Science 2016-11-28 Yifeng Ding

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a…

Logic · Mathematics 2014-04-01 Gyorgy Turan , Jon Yaggie

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…

Artificial Intelligence · Computer Science 2026-04-15 Victor David , Jérôme Delobelle , Jean-Guy Mailly

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit…

Logic in Computer Science · Computer Science 2015-10-27 Samuel Bucheli

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values to variables, but on a set of such assignments, called a team. This leads to high…

Logic in Computer Science · Computer Science 2021-02-23 Erich Grädel , Phil Pützstück