English
Related papers

Related papers: Quantifier Instantiations: To Mimic or To Revolt?

200 papers

The sequential process of conceptualization and instantiation is essential to generalizable commonsense reasoning as it allows the application of existing knowledge to unfamiliar scenarios. However, existing works tend to undervalue the…

Computation and Language · Computer Science 2024-05-24 Weiqi Wang , Tianqing Fang , Chunyang Li , Haochen Shi , Wenxuan Ding , Baixuan Xu , Zhaowei Wang , Jiaxin Bai , Xin Liu , Jiayang Cheng , Chunkit Chan , Yangqiu Song

Despite the growing variety of languages supported by existing multilingual neural machine translation (MNMT) models, most of the world's languages are still being left behind. We aim to extend large-scale MNMT models to incorporate a new…

Computation and Language · Computer Science 2025-12-02 Wen Lai , Viktor Hangya , Yingli Shen , Alexander Fraser

We study the problem of learning to generate an answer (or completion) to a question (or prompt), where there could be multiple correct answers, any one of which is acceptable at test time. Learning is based on demonstrations of some…

Machine Learning · Computer Science 2026-02-27 Nirmit Joshi , Gene Li , Siddharth Bhandari , Shiva Prasad Kasiviswanathan , Cong Ma , Nathan Srebro

Large Language Models (LLMs) have been recently proposed for supporting domain modeling tasks mostly related to the completion of partial models by recommending additional model elements. However, there are many more modeling tasks, one of…

Software Engineering · Computer Science 2026-04-14 Andrei Coman , Lola Burgueño , Dominik Bork , Manuel Wimmer

We consider the problem of checking whether a proposed invariant $\varphi$ expressed in first-order logic with quantifier alternation is inductive, i.e. preserved by a piece of code. While the problem is undecidable, modern SMT solvers can…

Logic in Computer Science · Computer Science 2023-06-22 Yotam M. Y. Feldman , Oded Padon , Neil Immerman , Mooly Sagiv , Sharon Shoham

Modern learning systems increasingly rely on amortized learning - the idea of reusing computation or inductive biases shared across tasks to enable rapid generalization to novel problems. This principle spans a range of approaches,…

Machine Learning · Computer Science 2025-10-14 Sarthak Mittal , Divyat Mahajan , Guillaume Lajoie , Mohammad Pezeshki

Generative large language models (LLMs) with instruct training such as GPT-4 can follow human-provided instruction prompts and generate human-like responses to these prompts. Apart from natural language responses, they have also been found…

Artificial Intelligence · Computer Science 2023-09-29 Sumit Kumar Jha , Susmit Jha , Patrick Lincoln , Nathaniel D. Bastian , Alvaro Velasquez , Rickard Ewetz , Sandeep Neema

We present new methods for solving the Satisfiability Modulo Theories problem over the theory of Quantifier-Free Non-linear Integer Arithmetic, SMT(QF-NIA), which consists in deciding the satisfiability of ground formulas with integer…

Logic in Computer Science · Computer Science 2020-09-01 Cristina Borralleras , Daniel Larraz , Albert Oliveras , Enric Rodriguez-Carbonell , Albert Rubio

Imitation learning is an approach in which an agent learns how to execute a task by trying to mimic how one or more teachers perform it. This learning approach offers a compromise between the time it takes to learn a new task and the effort…

Machine Learning · Computer Science 2024-07-31 Nathan Gavenski , Felipe Meneguzzi , Michael Luck , Odinaldo Rodrigues

In this survey we review dynamic epistemic logics with modalities for quantification over information change. Of such logics we present complete axiomatizations, focussing on axioms involving the interaction between knowledge and such…

Logic in Computer Science · Computer Science 2023-03-22 Hans van Ditmarsch

Satisfiability Modulo Theories (SMT) specifications often rely on quantifiers to remain concise and declarative. However, checking the satisfiability of such specifications directly can be inefficient. A common optimization is to ground the…

Logic in Computer Science · Computer Science 2026-02-24 Pierre Carbonnelle

Accurately estimating semantic aleatoric and epistemic uncertainties in large language models (LLMs) is particularly challenging in free-form question answering (QA), where obtaining stable estimates often requires many expensive…

Computation and Language · Computer Science 2026-01-26 Ji Won Park , Kyunghyun Cho

We introduce a method to measure uncertainty in large language models. For tasks like question answering, it is essential to know when we can trust the natural language outputs of foundation models. We show that measuring uncertainty in…

Computation and Language · Computer Science 2023-04-18 Lorenz Kuhn , Yarin Gal , Sebastian Farquhar

Eliciting information to reduce uncertainty about a latent entity is a critical task in many application domains, e.g., assessing individual student learning outcomes, diagnosing underlying diseases, or learning user preferences. Though…

Computation and Language · Computer Science 2025-07-10 Jimmy Wang , Thomas Zollo , Richard Zemel , Hongseok Namkoong

Large Language Models have emerged as prime candidates to tackle misinformation mitigation. However, existing approaches struggle with hallucinations and overconfident predictions. We propose an uncertainty quantification framework that…

Computation and Language · Computer Science 2024-02-01 Mauricio Rivera , Jean-François Godbout , Reihaneh Rabbany , Kellin Pelrine

Large language models have led to significant progress across many NLP tasks, although their massive sizes often incur substantial computational costs. Distillation has become a common practice to compress these large and highly capable…

Computation and Language · Computer Science 2026-01-06 Zishun Yu , Shangzhe Li , Xinhua Zhang

Accurately quantifying uncertainty in large language models (LLMs) is crucial for their reliable deployment, especially in high-stakes applications. Current state-of-the-art methods for measuring semantic uncertainty in LLMs rely on strict…

Machine Learning · Computer Science 2024-10-31 Yashvir S. Grewal , Edwin V. Bonilla , Thang D. Bui

We propose cognitive prompting as a novel approach to guide problem-solving in large language models (LLMs) through structured, human-like cognitive operations, such as goal clarification, decomposition, filtering, abstraction, and pattern…

Computation and Language · Computer Science 2024-12-03 Oliver Kramer , Jill Baumann

Robustness of reasoning remains a significant challenge for large language models, and addressing it is essential for the practical applicability of AI-driven reasoning systems. We introduce Semantic Self-Verification (SSV), a novel…

Artificial Intelligence · Computer Science 2025-07-15 Mohammad Raza , Natasa Milic-Frayling

A quantitative method is suggested, where meanings of words, and grammatic rules about these, of a vocabulary are represented by real numbers. People meet randomly, and average their vocabularies if they are equal; otherwise they either…

Physics and Society · Physics 2009-11-13 Caglar Tuncay