English
Related papers

Related papers: Modal Translation of Substructural Logics

200 papers

This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation…

Logic in Computer Science · Computer Science 2024-02-07 Luca Aceto , Ignacio Fábregas , David de Frutos Escrig , Anna Ingólfsdóttir , Miguel Palomino

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Logic · Mathematics 2020-05-28 Tomasz Witczak

In this article, we try to formulate a definition of ''many-valued logical structure''. For this, we embark on a deeper study of Suszko's Thesis ($\mathbf{ST}$) and show that the truth or falsity of $\mathbf{ST}$ depends, at least, on the…

Logic · Mathematics 2026-03-03 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We introduce a logic for knowledge representation and reasoning on protein-protein interactions. Modulo a theory, formulas describe protein structures and dynamic changes. They can be composed in order to add or remove static and dynamic…

Logic in Computer Science · Computer Science 2019-09-19 Adrien Husson , Jean Krivine

Modal interpretations have the ambition to construe quantum mechanics as an objective, man-independent description of physical reality. Their second leading idea is probabilism: quantum mechanics does not completely fix physical reality but…

Quantum Physics · Physics 2007-05-23 Dennis Dieks

Traditional neural networks have an impressive classification performance, but what they learn cannot be inspected, verified or extracted. Neural Logic Networks on the other hand have an interpretable structure that enables them to learn a…

Machine Learning · Computer Science 2026-01-26 Vincent Perreault , Katsumi Inoue , Richard Labib , Alain Hertz

We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inference algorithms are often explained in terms of composition of…

The possibility of translating logic programs into functional ones has long been a subject of investigation. Common to the many approaches is that the original logic program, in order to be translated, needs to be well-moded and this has…

Programming Languages · Computer Science 2007-05-23 S. Etalle , J. Mountjoy

In previous work [Lewitzka, Log. J. IGPL 2017], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from G\"odel's interpretation…

Logic in Computer Science · Computer Science 2019-01-01 Steffen Lewitzka

We develop a linear response framework for interpretability that treats a neural network as a Bayesian statistical mechanical system. A small perturbation of the data distribution, for example shifting the Pile toward GitHub or legal text,…

Machine Learning · Computer Science 2026-03-10 Garrett Baker , George Wang , Jesse Hoogland , Daniel Murfet

We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of…

Logic in Computer Science · Computer Science 2016-08-31 Carlo Montangero , Laura Semini

In this paper, we shall give another proof of the faithfulness of Blass translation (for short, $B$-translation) of the propositional fragment $\bf L_1$ of Le\'{s}niewski's ontology in the modal logic $\bf K$ \it by means of Hintikka…

Logic · Mathematics 2020-11-03 Takao Inoué

Mechanistic interpretability aims to explain neural model behaviour by reverse-engineering learned computational structure into human-understandable components. Without a formal framework, however, mechanistic explanations cannot be…

Machine Learning · Computer Science 2026-05-12 Ward Gauderis , Thomas Dooms , Steven T. Holmer , Kola Ayonrinde , Geraint A. Wiggins

We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Goedel-McKinsey-Tarski-Artemov definition of Intuitionistic Logic as…

Logic in Computer Science · Computer Science 2017-08-09 Simon Kramer

We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…

Logic in Computer Science · Computer Science 2025-12-30 Helle Hvid Hansen , Wolfgang Poiger

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…

Logic in Computer Science · Computer Science 2025-02-05 Francesco Dagnino , Fabio Pasquali

This paper presents a novel concept of a Polyatomic Logic and initiates its systematic study. This approach, inspired by Inquisitive semantics, is obtained by taking a variant of a given logic, obtained by looking at the fragment covered by…

Logic · Mathematics 2023-03-28 Rodrigo Nicolau Almeida

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

Logic in Computer Science · Computer Science 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the…

Logic · Mathematics 2020-07-13 David Ellerman