English
Related papers

Related papers: A modest proposal: explicit support for foundation…

200 papers

Logical reasoning with large language models (LLMs) has received growing attention. One mainstream approach translates natural language into formal logic and then applies symbolic solvers for deduction. While effective in many tasks, these…

Computation and Language · Computer Science 2026-02-02 Qingchuan Li , Jiatong Li , Zirui Liu , Mingyue Cheng , Yuting Zeng , Qi Liu , Tongxuan Liu

Logical reasoning remains a challenge for natural language processing, but it can be improved by training language models to mimic theorem provers on procedurally generated problems. Previous work used domain-specific proof generation…

Computation and Language · Computer Science 2024-06-18 Damien Sileo

Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give high-level, modular, and formal specifications of many important judgments in the area of programming languages…

Logic in Computer Science · Computer Science 2007-05-23 Raymond C. McDowell , Dale A. Miller

This work introduces Symbolic-Aided Chain-of-Thought (CoT), an improved approach to standard CoT, for logical reasoning in large language models (LLMs). The key idea is to integrate lightweight symbolic representations into few-shot…

Artificial Intelligence · Computer Science 2025-10-07 Phuong Minh Nguyen , Tien Huu Dang , Naoya Inoue

The prevailing approach to distilling reasoning from Large Language Models (LLMs)-behavioral cloning from textual rationales-is fundamentally limited. It teaches Small Language Models (SLMs) to mimic surface-level patterns rather than the…

Artificial Intelligence · Computer Science 2025-10-02 Xiangyu Wen , Junhua Huang , Zeju Li , Min Li , Jianyuan Zhong , Zhijian Xu , Mingxuan Yuan , Yongxiang Huang , Qiang Xu

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk,…

Logic in Computer Science · Computer Science 2021-08-13 Nils Kürbis

High-assurance reasoning, particularly in critical domains such as law and medicine, requires conclusions that are accurate, verifiable, and explicitly grounded in evidence. This reasoning relies on premises codified from rules, statutes,…

Artificial Intelligence · Computer Science 2025-10-03 Navapat Nananukul , Yue Zhang , Ryan Lee , Eric Boxer , Jonathan May , Vibhav Giridhar Gogate , Jay Pujara , Mayank Kejriwal

A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…

Logic in Computer Science · Computer Science 2010-08-19 Robin Adams , Zhaohui Luo

Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…

Artificial Intelligence · Computer Science 2013-04-10 Carl Kadie

This paper extends the literature on the strict-tolerant logical approach by applying its methods to intuitionistic and minimal logic. In short, the strict-tolerant approach modifies the usual notion of logical consequence by stipulating…

Logic in Computer Science · Computer Science 2025-09-15 Victor Barroso-Nascimento , German Mejia

The success of automated reasoning techniques over large natural-language texts heavily relies on a fine-grained analysis of natural language assumptions. While there is a common agreement that the analysis should be hyperintensional, most…

Computation and Language · Computer Science 2019-06-19 Marie Duží , Aleš Horák

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

This paper presents an extension of Defeasible Deontic Logic to deal with the Pragmatic Oddity problem. The logic applies three general principles: (1) the Pragmatic Oddity problem must be solved within a general logical treatment of CTD…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Silvano Colombo Tosatto , Antonino Rotolo

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Stephan Tobies

We study a novel language model architecture that is capable of scaling test-time computation by implicitly reasoning in latent space. Our model works by iterating a recurrent block, thereby unrolling to arbitrary depth at test-time. This…

Large Language Models (LLMs) have shown impressive performance on complex tasks through Chain-of-Thought (CoT) reasoning. However, conventional CoT relies on explicitly verbalized intermediate steps, which constrains its broader…

Computation and Language · Computer Science 2025-11-04 Xinghao Chen , Anhao Zhao , Heming Xia , Xuan Lu , Hanlin Wang , Yanjun Chen , Wei Zhang , Jian Wang , Wenjie Li , Xiaoyu Shen

Informal logic is a method of argument analysis which is complementary to that of formal logic, providing for the pragmatic treatment of features of argumentation which cannot be reduced to logical form. The central claim of this paper is…

History and Overview · Mathematics 2019-05-03 Andrew Aberdein

HyLL (Hybrid Linear Logic) and SELL (Subexponential Linear Logic) are logical frameworks that have been extensively used for specifying systems that exhibit modalities such as temporal or spatial ones. Both frameworks have linear logic (LL)…

Logic in Computer Science · Computer Science 2016-09-05 Joëlle Despeyroux , Carlos Olarte , Elaine Pimentel

While long, explicit chains-of-thought (CoT) have proven effective on complex reasoning tasks, they are costly to generate during inference. Non-verbal reasoning methods have emerged with shorter generation lengths by leveraging continuous…

Computation and Language · Computer Science 2026-04-28 Keshav Ramji , Tahira Naseem , Ramón Fernandez Astudillo