English
Related papers

Related papers: Filling in the semantics for intuitionistic condit…

200 papers

We revisit completion modulo equational theories for left-linear term rewrite systems where unification modulo the theory is avoided and the normal rewrite relation can be used in order to decide validity questions. To that end, we give a…

Logic in Computer Science · Computer Science 2025-04-30 Johannes Niederhauser , Nao Hirokawa , Aart Middeldorp

Inferential models (IMs) represent a novel possibilistic approach for achieving provably valid statistical inference. This paper introduces a general framework for fusing independent IMs in a "black-box" manner, requiring no knowledge of…

Statistics Theory · Mathematics 2024-05-14 Leonardo Cella

The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…

Logic in Computer Science · Computer Science 2009-09-25 Marc Denecker

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

This paper develops a logic based on causal inferences to formally capture the concept of instrumental obligation. We establish a causal deontic model that extends causal models with priority structures, allowing us to represent both the…

Logic · Mathematics 2025-05-13 Jialiang Yan , Qingyu He

In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of…

Logic · Mathematics 2018-12-19 Rosalie Iemhoff , Fan Yang

Logical inference algorithms for conditional independence (CI) statements have important applications from testing consistency during knowledge elicitation to constraintbased structure learning of graphical models. We prove that the…

Artificial Intelligence · Computer Science 2012-05-14 Mathias Niepert

Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…

Logic · Mathematics 2026-04-28 Shay Allen Logan , Blane Worley

Language Models (LMs) have emerged as powerful sources of evidence for linguists seeking to develop theories of syntax. In this paper, we argue that causal interpretability methods, applied to LMs, can greatly enhance the value of such…

Computation and Language · Computer Science 2025-10-01 Sasha Boguraev , Christopher Potts , Kyle Mahowald

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…

Category Theory · Mathematics 2022-11-04 Robin Cockett , Priyaa Varshinee Srinivasan

The safety of automated driving systems must be justified by convincing arguments and supported by compelling evidence to persuade certification agencies, regulatory entities, and the general public to allow the systems on public roads.…

Software Engineering · Computer Science 2024-10-28 Jonas Krook , Yuvaraj Selvaraj , Wolfgang Ahrendt , Martin Fabian

We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…

Logic in Computer Science · Computer Science 2025-07-16 Renato Leme , Carlos Olarte , Elaine Pimentel , Marcelo E. Coniglio

In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…

Logic in Computer Science · Computer Science 2022-06-16 Chun-Yu Lin , Churn-Jung Liau

Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…

Logic in Computer Science · Computer Science 2025-08-26 Włodzimierz Drabent

As deep neural models in NLP become more complex, and as a consequence opaque, the necessity to interpret them becomes greater. A burgeoning interest has emerged in rationalizing explanations to provide short and coherent justifications for…

Computation and Language · Computer Science 2024-05-21 Neema Kotonya , Francesca Toni

In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…

Quantum Physics · Physics 2009-12-22 G. Domenech , H. Freytes , C. de Ronde

We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability…

Logic in Computer Science · Computer Science 2026-05-20 Carlos Areces , Pablo Barceló , Valentin Cassano , Pablo F. Castro , Stéphane Demri , Raul Fervari

In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…

Logic · Mathematics 2018-01-19 Tomasz Witczak

Intuitionistic epistemic logic introduces an epistemic operator, which reflects the intended BHK semantics of intuitionism, to intuitionistic logic. The fundamental assumption concerning intuitionistic knowledge and belief is that it is the…

Logic · Mathematics 2016-01-14 Tudor Protopopescu

We explore an inquisitive modal logic designed to reason about neighborhood models. This logic is based on an inquisitive strict conditional operator, which quantifies over neighborhoods, and which can be applied to both statements and…

Logic · Mathematics 2024-11-11 Ivano Ciardelli