English
Related papers

Related papers: Logical Negation Augmenting and Debiasing for Prom…

200 papers

Difficult decision-making problems abound in various disciplines and domains. The proliferation of generative techniques, especially large language models (LLMs), has excited interest in using them for decision support. However, LLMs cannot…

Artificial Intelligence · Computer Science 2025-09-16 Boris Kovalerchuk , Brent D. Fegley

Large language models (LLMs) have demonstrated impressive capabilities across a wide range of reasoning tasks, including logical and mathematical problem-solving. While prompt-based methods like Chain-of-Thought (CoT) can enhance LLM…

Artificial Intelligence · Computer Science 2026-01-13 Xiaoheng Wang , Tongxuan Liu , Zi Gong , Xianzhe Dong , Yuting Zeng , Minhan Hu , Weizhe Huang , Jing Li

Large language models (LLMs) have demonstrated remarkable capabilities in language generation, understanding, and few-shot learning in recent years. An extensive body of work has explored how their performance may be further improved…

Computation and Language · Computer Science 2023-05-24 Yilun Du , Shuang Li , Antonio Torralba , Joshua B. Tenenbaum , Igor Mordatch

Large Language Models (LLMs) have demonstrated remarkable performance across various tasks by effectively utilizing a prompting strategy. However, they are highly sensitive to input perturbations, such as typographical errors or slight…

Computation and Language · Computer Science 2026-05-27 Lin Mu , Guowei Chu , Li Ni , Lei Sang , Yiwen Zhang

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…

Logic · Mathematics 2025-10-14 Oscar Ramírez

Reinforcement learning has proven effective for enhancing multi-step reasoning in large language models (LLMs), yet its benefits have not fully translated to multilingual contexts. Existing methods struggle with a fundamental trade-off:…

Computation and Language · Computer Science 2026-05-22 Yuchun Fan , Bei Li , Peiguang Li , Yilin Wang , Yongyu Mu , Jian Yang , Xin Chen , Rongxiang Weng , Jingang Wang , Xunliang Cai , Jingbo Zhu , Tong Xiao

For a LLM to be trustworthy, its confidence level should be well-calibrated with its actual performance. While it is now common sense that LLM performances are greatly impacted by prompts, the confidence calibration in prompting LLMs has…

Computation and Language · Computer Science 2024-09-10 Xinran Zhao , Hongming Zhang , Xiaoman Pan , Wenlin Yao , Dong Yu , Tongshuang Wu , Jianshu Chen

Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic…

Programming Languages · Computer Science 2020-02-19 Angelos Charalambidis , Zoltán Ésik , Panos Rondogiannis

Rapidly increasing model scales coupled with steering methods such as chain-of-thought prompting have led to drastic improvements in language model reasoning. At the same time, models struggle with compositional generalization and are far…

Computation and Language · Computer Science 2024-08-28 Jay Shim , Grant Kruttschnitt , Alyssa Ma , Daniel Kim , Benjamin Chek , Athul Anand , Kevin Zhu , Sean O'Brien

Large Language Models (LLMs) enhanced with retrieval -- commonly referred to as Retrieval-Augmented Generation (RAG) -- have demonstrated strong performance in knowledge-intensive tasks. However, RAG pipelines often fail when retrieved…

Computation and Language · Computer Science 2025-11-07 Shiyin Lin

This study aims to demonstrate the methods for detecting negations in a sentence by uniquely evaluating the lexical structure of the text via word-sense disambiguation. The proposed framework examines all the unique features in the various…

Computation and Language · Computer Science 2025-02-11 Izunna Okpala , Guillermo Romera Rodriguez , Andrea Tapia , Shane Halse , Jess Kropczynski

Chain-of-Thought (CoT) prompting methods have enabled large language models (LLMs) to generate reasoning paths and solve math word problems (MWPs). However, they are sensitive to mistakes in the paths, as any mistake can result in an…

Computation and Language · Computer Science 2023-12-13 Zhenyu Wu , Meng Jiang , Chao Shen

We study how Large Language Models (LLMs) process negation mechanistically. First, we establish that even though open-weight models often provide wrong answers to questions involving negation, they do possess internal components that…

Computation and Language · Computer Science 2026-05-06 Zhejian Zhou , Tianyi Zhou , Robin Jia , Jonathan May

This study critically evaluates the efficacy of prompting methods in enhancing the mathematical reasoning capability of large language models (LLMs). The investigation uses three prescriptive prompting methods - simple, persona, and…

Although LLMs have the potential to transform many fields, they still underperform humans in reasoning tasks. Existing methods induce the model to produce step-by-step calculations, but this research explores the question: Does making the…

Computation and Language · Computer Science 2024-08-27 Dharunish Yugeswardeenoo , Kevin Zhu , Sean O'Brien

Prior work has shown that presupposition in generated questions can introduce unverified assumptions, leading to inconsistencies in claim verification. Additionally, prompt sensitivity remains a significant challenge for large language…

Computation and Language · Computer Science 2025-09-30 Shubhashis Roy Dipta , Francis Ferraro

Negation has been a long-standing challenge for language models. Previous studies have shown that they struggle with negation in many natural language understanding tasks. In this work, we propose a self-supervised method to make language…

Computation and Language · Computer Science 2025-02-12 MohammadHossein Rezaei , Eduardo Blanco

Large language models often struggle to recognize their knowledge limits in closed-book question answering, leading to confident hallucinations. While decomposed prompting is typically used to improve accuracy, we investigate its impact on…

Computation and Language · Computer Science 2026-02-05 Dhruv Madhwal , Lyuxin David Zhang , Dan Roth , Tomer Wolfson , Vivek Gupta

Although Large Language Models (LLMs) have demonstrated impressive formal reasoning abilities, they often break down when problems require complex proof planning. One promising approach for improving LLM reasoning abilities involves…

Artificial Intelligence · Computer Science 2026-01-27 Joseph Cotnareanu , Didier Chetelat , Yingxue Zhang , Mark Coates

Process Reward Models (PRMs) play a central role in evaluating and guiding multi-step reasoning in large language models (LLMs), especially for mathematical problem solving. However, we identify a pervasive length bias in existing PRMs:…

Computation and Language · Computer Science 2026-05-20 Congmin Zheng , Jiachen Zhu , Jianghao Lin , Xinyi Dai , Weiwen Liu , Haoxuan Li , Yong Yu , Weinan Zhang , Mengyue Yang