English
Related papers

Related papers: Term-Level Reasoning in Support of Bit-blasting

200 papers

Test-time scaling has significantly improved large language model performance, enabling deeper reasoning to solve complex problems. However, this increased reasoning capability also leads to excessive token generation and unnecessary…

Scientific texts often convey authority due to their technical language and complex data. However, this complexity can sometimes lead to the spread of misinformation. Non-experts are particularly susceptible to misleading claims based on…

Computation and Language · Computer Science 2025-06-10 Yuji Zhang , Qingyun Wang , Cheng Qian , Jiateng Liu , Chenkai Sun , Denghui Zhang , Tarek Abdelzaher , Chengxiang Zhai , Preslav Nakov , Heng Ji

Large Language Models (LLMs) have revolutionized natural language processing, yet they struggle with inconsistent reasoning, particularly in novel domains and complex logical sequences. This research introduces Proof of Thought, a framework…

Artificial Intelligence · Computer Science 2024-10-24 Debargha Ganguly , Srinivasan Iyengar , Vipin Chaudhary , Shivkumar Kalyanaraman

Generative Artificial Intelligence (GenAI) has demonstrated its capabilities in the present world that reduce human effort significantly. It utilizes deep learning techniques to create original and realistic content in terms of text,…

Artificial Intelligence · Computer Science 2025-12-11 Aman Kumar , Deepak Narayan Gadde

Large language models (LLMs) exhibit failures on elementary symbolic tasks such as character counting in a word, despite excelling on complex benchmarks. Although this limitation has been noted, the internal reasons remain unclear. We use…

Computation and Language · Computer Science 2026-04-02 Ayan Datta , Mounika Marreddy , Alexander Mehler , Zhixue Zhao , Radhika Mamidi

Large Language Models (LLMs) have shown strong capabilities in document re-ranking, a key component in modern Information Retrieval (IR) systems. However, existing LLM-based approaches face notable limitations, including ranking…

Information Retrieval · Computer Science 2025-10-03 Pinhuan Wang , Zhiqiu Xia , Chunhua Liao , Feiyi Wang , Hang Liu

Abella is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a two-level logic approach to specification and…

Logic in Computer Science · Computer Science 2008-12-18 Andrew Gacek

General-purpose Large Language Models (LLMs) have achieved remarkable success in intelligence, performing comparably to human experts on complex reasoning tasks such as coding and mathematical reasoning. However, generating formal proofs in…

DatalogMTL is a powerful rule-based language for temporal reasoning. Due to its high expressive power and flexible modeling capabilities, it is suitable for a wide range of applications, including tasks from industrial and financial…

Artificial Intelligence · Computer Science 2025-12-16 Shaoyu Wang , Kaiyue Zhao , Dongliang Wei , Przemysław Andrzej Wałęga , Dingmin Wang , Hongming Cai , Pan Hu

Tabular reasoning benchmarks mix semantic inference, numerical computation, and brittle table formatting, yet evaluations for small models remain vulnerable to contamination, dataset artifacts, and retrieval failures. We propose GLEAN, a…

Databases · Computer Science 2026-03-04 Qizhi Wang

Retrieval-augmented generation (RAG) systems can effectively mitigate the hallucination problem of large language models (LLMs),but they also possess inherent vulnerabilities. Identifying these weaknesses before the large-scale real-world…

Information Retrieval · Computer Science 2025-05-23 Hongru Song , Yu-an Liu , Ruqing Zhang , Jiafeng Guo , Yixing Fan

The large language models (LLMs) might produce a persuasive argument within mathematical and logical fields, although such argument often includes some minor missteps, including the entire omission of side conditions, invalid inference…

Artificial Intelligence · Computer Science 2026-04-09 Kranthi Kommuru , Kunal Khanvilkar , Gaurav Parekh

The class of type-two basic feasible functionals ($\mathtt{BFF}_2$) is the analogue of $\mathtt{FP}$ (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments.…

Logic in Computer Science · Computer Science 2025-11-12 Patrick Baillot , Ugo Dal Lago , Cynthia Kop , Deivid Vale

The Retrieval-augmented generation (RAG) system based on Large language model (LLM) has made significant progress. It can effectively reduce factuality hallucinations, but faithfulness hallucinations still exist. Previous methods for…

Computation and Language · Computer Science 2026-01-07 Jianpeng Hu , Yanzeng Li , Jialun Zhong , Wenfa Qi , Lei Zou

We present in this paper a reformulation of the usual set-theoretical semantics of the description logic $\mathcal{ALC}$ with general TBoxes by using categorical language. In this setting, $\mathcal{ALC}$ concepts are represented as…

Logic in Computer Science · Computer Science 2022-05-17 Ludovic Brieulle , Chan Le Duc , Pascal Vaillant

Large Reasoning Models (LRMs) achieve strong performance on complex reasoning tasks by generating long Chains of Thought (CoTs). However, this paradigm might incur substantial token overhead, especially when models "overthink" by producing…

Artificial Intelligence · Computer Science 2025-12-04 Zhiyuan He , Dingmin Wang

Although large language models (LLMs) have been touted for their ability to generate natural-sounding text, there are growing concerns around possible negative effects of LLMs such as data memorization, bias, and inappropriate language.…

Machine Learning · Computer Science 2023-05-10 Michael Kuchnik , Virginia Smith , George Amvrosiadis

Large language models (LLMs) are able to generate human-like responses to user queries. However, LLMs exhibit inherent limitations, especially because they hallucinate. This paper introduces LP-LM, a system that grounds answers to questions…

Artificial Intelligence · Computer Science 2025-02-14 Katherine Wu , Yanhong A. Liu

Retrieval-Augmented Generation (RAG) significantly improves the factuality of Large Language Models (LLMs), yet standard pipelines often lack mechanisms to verify inter- mediate reasoning, leaving them vulnerable to hallucinations in…

Computation and Language · Computer Science 2026-03-12 Eeham Khan , Luis Rodriguez , Marc Queudot

We propose a new, training-free method, Graph Reasoning via Retrieval Augmented Framework (GRRAF), that harnesses retrieval-augmented generation (RAG) alongside the code-generation capabilities of large language models (LLMs) to address a…

Artificial Intelligence · Computer Science 2025-09-17 Hanqing Li , Kiran Sheena Jyothi , Henry Liang , Sharika Mahadevan , Diego Klabjan
‹ Prev 1 8 9 10 Next ›