English
Related papers

Related papers: Logic for approximate entailment in ordered univer…

200 papers

We introduce PRELUDE, a benchmark for evaluating long-context understanding through the task of determining whether a character's prequel story is consistent with the canonical narrative of the original book. Our task poses a stronger…

Computation and Language · Computer Science 2025-08-15 Mo Yu , Tsz Ting Chung , Chulun Zhou , Tong Li , Rui Lu , Jiangnan Li , Liyan Xu , Haoshu Lu , Ning Zhang , Jing Li , Jie Zhou

Whilst mathematicians assume classical reasoning principles by default they often context switch when working, restricting themselves to various forms of subclassical reasoning. This pattern is especially common amongst logicians and set…

Logic in Computer Science · Computer Science 2023-02-21 Martin Berger , Dominic P. Mulligan

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Logic in Computer Science · Computer Science 2007-05-23 Jørgen Villadsen

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

In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…

Logic in Computer Science · Computer Science 2023-07-21 Anindya Banerjee , Ramana Nagasamudram , David A. Naumann

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…

Logic in Computer Science · Computer Science 2015-03-19 Nikolay Ivanov , Dimiter Vakarelov

We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…

Artificial Intelligence · Computer Science 2017-07-07 Kevin S. Van Horn

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…

Computation and Language · Computer Science 2022-10-14 Britta Grusdt , Daniel Lassiter , Michael Franke

We introduce a type and effect system, for an imperative object calculus, which infers "sharing" possibly introduced by the evaluation of an expression, represented as an equivalence relation among its free variables. This direct…

Programming Languages · Computer Science 2018-08-03 Paola Giannini , Tim Richter , Marco Servetto , Elena Zucca

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

This paper gives a generative model of the interpretation of formal logic for data-driven logical reasoning. The key idea is to represent the interpretation as likelihood of a formula being true given a model of formal logic. Using the…

Artificial Intelligence · Computer Science 2022-03-01 Hiroyuki Kido

Principles of analogical reasoning have recently been applied in the context of machine learning, for example to develop new methods for classification and preference learning. In this paper, we argue that, while analogical reasoning is…

Machine Learning · Computer Science 2020-05-27 Eyke Hüllermeier

We introduce APPL (Abstract Program Property Logic), a unifying Hoare-style logic that subsumes standard Hoare logic, incorrectness logic, and several variants of Hyper Hoare logic. APPL provides a principled foundation for abstract program…

Logic in Computer Science · Computer Science 2026-04-23 Paolo Baldan , Roberto Bruni , Francesco Ranzato , Diletta Rigo

Artificial Expert Intelligence (AEI) seeks to transcend the limitations of both Artificial General Intelligence (AGI) and narrow AI by integrating domain-specific expertise with critical, precise reasoning capabilities akin to those of top…

Artificial Intelligence · Computer Science 2024-12-04 Shai Shalev-Shwartz , Amnon Shashua , Gal Beniamini , Yoav Levine , Or Sharir , Noam Wies , Ido Ben-Shaul , Tomer Nussbaum , Shir Granot Peled

There is knowledge. There is belief. And there is tacit agreement.' 'We may talk about objects. We may talk about attributes of the objects. Or we may talk both about objects and their attributes.' This work inspects tacit agreements on…

Artificial Intelligence · Computer Science 2014-04-25 Ryuta Arisaka

Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…

Programming Languages · Computer Science 2020-02-21 Gilles Barthe , Raphaëlle Crubillé , Ugo Dal Lago , Francesco Gavazzo

Jurisprudence, the study of how judges should properly decide cases, and alignment, the science of getting AI models to conform to human values, share a fundamental structure. These seemingly distant fields both seek to predict and shape…

Artificial Intelligence · Computer Science 2026-05-12 Nicholas Caputo

Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence that triggers some action of the overall system, then one can…

Artificial Intelligence · Computer Science 2022-05-26 Christian Alrabbaa , Franz Baader , Stefan Borgwardt , Patrick Koopmann , Alisa Kovtunova

The Existential Theory of the Reals (ETR) consists of existentially quantified Boolean formulas over equalities and inequalities of polynomial functions of variables in $\mathbb{R}$. In this paper we propose and study the approximate…

Computational Complexity · Computer Science 2020-03-24 Argyrios Deligkas , John Fearnley , Themistoklis Melissourgos , Paul G. Spirakis