English
Related papers

Related papers: The Modal Cube Revisited: Semantics without Worlds…

200 papers

The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou…

Logic in Computer Science · Computer Science 2019-11-18 Amanda Vidal , Francesc Esteva , Lluis Godo

As multi-agent AI systems evolve from simple chatbots to autonomous swarms, debugging semantic failures requires reasoning about knowledge, belief, causality, and obligation, precisely what modal logic was designed to formalize. However,…

Artificial Intelligence · Computer Science 2026-02-13 Antonin Sulc

The relational version of the modal interpretation offers both a consistent quantum ontology and solution for quantum paradoxes within the framework of nonrelativistic quantum mechanics. In the present paper this approach is generalized for…

Quantum Physics · Physics 2007-05-23 Gyula Bene

Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…

Logic · Mathematics 2024-07-24 Stefano Bonzio , Nicolò Zamperlin

We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal…

Logic in Computer Science · Computer Science 2025-12-01 Ioana Leustean , Natalia Moanga , Traian Florin Serbanuta

The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed in polynomial space whereas semantic approaches directly…

Logic in Computer Science · Computer Science 2008-04-03 Lutz Schröder , Dirk Patinson

Modal types -- types that are derived from proof systems of modal logic -- have been studied as theoretical foundations of metaprogramming, where program code is manipulated as first-class values. In modal type systems, modality corresponds…

Logic in Computer Science · Computer Science 2023-01-06 Yuito Murase , Yuichi Nishiwaki , Atsushi Igarashi

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

Logic in Computer Science · Computer Science 2021-05-19 Alexandru Baltag , Nick Bezhanishvili , David Fernández-Duque

This note clarifies the concept of syntax and semantics and their relationships. Today, a lot of confusion arises from the fact that the word "semantics" is used in different meanings. We discuss a general approach at defining semantics…

Software Engineering · Computer Science 2014-09-25 Bernhard Rumpe

We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without…

Logic in Computer Science · Computer Science 2015-08-03 Christoph Benzmüller , Maximilian Claus , Nik Sultana

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…

Logic in Computer Science · Computer Science 2014-11-27 Richard Prideaux Evans , Martin Berger

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…

Logic in Computer Science · Computer Science 2012-04-30 David Baelde , Gopalan Nadathur

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…

Logic in Computer Science · Computer Science 2021-07-20 Vitor Greati , Sérgio Marcelino , João Marcos

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

Quantum Physics · Physics 2026-02-19 Olivier Brunet

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational…

Logic in Computer Science · Computer Science 2007-05-23 Roberto Bruni , Ugo Montanari , Francesca Rossi

Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal…

Logic in Computer Science · Computer Science 2017-01-11 Carsten Lutz , Frank Wolter

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer
‹ Prev 1 8 9 10 Next ›