English
Related papers

Related papers: Essay on modality across different logics

200 papers

We introduce a framework for reasoning about the security of computer systems using modal logic. This framework is sufficiently expressive to capture a variety of known security properties, while also being intuitive and independent of…

Cryptography and Security · Computer Science 2023-09-19 Matvey Soloviev , Musard Balliu , Roberto Guanciale

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

Artificial Intelligence · Computer Science 2013-04-05 Enrique H. Ruspini

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…

Logic in Computer Science · Computer Science 2026-04-27 Daniil Kozhemiachenko , Igor Sedlár

Quantified modal logic provides a natural logical language for reasoning about modal attitudes even while retaining the richness of quantification for referring to predicates over domains. But then most fragments of the logic are…

Logic in Computer Science · Computer Science 2018-03-29 Anantha Padmanabha , R. Ramanujam , Yanjing Wang

Modal separability for modal fixpoint formulae is the problem to decide for two given modal fixpoint formulae $\varphi,\varphi'$ whether there is a modal formula $\psi$ that separates them, in the sense that $\varphi\models\psi$ and…

Logic in Computer Science · Computer Science 2026-01-30 Jean Christoph Jung , Jędrzej Kołodziejski

Causality is one of the fundamental structures of spacetimes, determining the possible behaviour and propagation of physical information. Causal structure can be analysed through the various modal logics it induces. The modal logics for the…

Logic · Mathematics 2026-03-17 Marco Lewis , Nesta van der Schaaf

We study modal separability for fixpoint formulae: given two mutually exclusive fixpoint formulae $\varphi,\varphi'$, decide whether there is a modal formula $\psi$ that separates them, that is, that satisfies…

Logic in Computer Science · Computer Science 2024-06-04 Jean Christoph Jung , Jędrzej Kołodziejski

We propose a new modal logic endowed with a simple deductive system to interpret Aristotle's theory of the modal syllogism. While being inspired by standard propositional modal logic it is also a logic of terms that admits a (sound)…

Logic · Mathematics 2022-06-15 Clarence Protin

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…

Logic in Computer Science · Computer Science 2023-07-25 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki , Nicolas Troquard

We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…

Logic · Mathematics 2025-02-05 Matthew Harrison-Trainor , Miles Kretschmer

When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…

Artificial Intelligence · Computer Science 2013-02-18 Choh Man Teng

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

We determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results. Given a fixed-point model $\mathcal{M}$, or an axiomatization $S$ thereof, we find a modal…

Logic · Mathematics 2020-10-28 Carlo Nicolai , Johannes Stern

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…

Logic · Mathematics 2023-11-17 Adam Přenosil

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

We present a logic for the reasoning about necessity and justifications which is independent from relational semantics. We choose the concept of justification -- coming from a class of "Justification Logics" (Artemov 2008, Fitting 2009) --…

Logic in Computer Science · Computer Science 2015-03-20 Steffen Lewitzka

When language models answer open-ended problems, they implicitly make hidden decisions that shape their outputs, leaving users with uncontextualized answers rather than a working map of the problem; drawing on multiverse analysis from…

Human-Computer Interaction · Computer Science 2026-05-05 Andre Ye , Jenny Y. Huang , Alicia Guo , Rose Novick , Tamara Broderick , Mitchell L. Gordon

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