paper-with-me

Papers

Logic.py: Bridging the Gap between LLMs and Constraint Solvers

2025-02-17 · Pascal Kesseli, Peter O'Hearn, Ricardo Silveira Cabral

We present a novel approach to formalise and solve search-based problems using large language models, which significantly improves upon previous state-of-the-art results. We demonstrate the efficacy of this approach on the logic puzzles benchmark ZebraLogicBench. Instead of letting the LLM attempt to directly solve the puzzles, our method prompts the model to formalise the problem in a logic-focused domain-specific language (DSL) called Logic.py. This formalised representation is then solved using a constraint solver, leveraging the strengths of both the language model and the solver. Our approach achieves a remarkable 65% absolute improvement over the baseline performance of Llama 3.1 70B on ZebraLogicBench, setting a new state-of-the-art with an accuracy of over 90%. This significant advancement demonstrates the potential of combining language models with domain-specific languages and auxiliary tools on traditionally challenging tasks for LLMs.

📄 PDF Abstract BibTeX arXiv:2502.15776

Code (1)

facebookresearch/polymath 공식 구현

Tasks

Language ModelingLanguage Modelling

Methods 이 논문이 사용한 방법론

LLaMA LLaMA is a collection of foundation language models ranging from 7B to 65B parameters. It is based on the transformer architecture with various improvements that were…

Similar Papers 제목 키워드 기반

Constrained Multi-Task Learning for Bridging Resolution

2022-05-01 · ACL 2022 5 · Hideo Kobayashi, Yufang Hou, Vincent Ng

We examine the extent to which supervised bridging resolvers can be improved without employing additional labeled bridging data by proposing a novel constrained multi-task learning framework for bridging resolution, with…

Multi-Task Learning

Fit The Right NP-Hard Problem: End-to-end Learning of Integer Programming Constraints

2020-10-17 · NeurIPS Workshop LMCA 2020 12 · Anselm Paulus, Michal Rolinek, Vít Musil, Brandon Amos 외

Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-Hard problems can be expressed as int…

CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints

2021-05-05 · Anselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos 외

Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-hard problems can be expressed as int…

SymbolicAI: A framework for logic-based approaches combining generative models and solvers

2024-02-01 · Marius-Constantin Dinu, Claudiu Leoveanu-Condrei, Markus Holzleitner, Werner Zellinger 외

We introduce SymbolicAI, a versatile and modular framework employing a logic-based approach to concept learning and flow management in generative processes. SymbolicAI enables the seamless integration of generative model…

Few-Shot LearningIn-Context LearningProbabilistic Programming

DiLA: Enhancing LLM Tool Learning with Differential Logic Layer

2024-02-19 · Yu Zhang, Hui-Ling Zhen, Zehua Pei, Yingzhao Lian 외

Considering the challenges faced by large language models (LLMs) in logical reasoning and planning, prior efforts have sought to augment LLMs with access to external solvers. While progress has been made on simple reason…

Language ModelingLanguage ModellingLogical Reasoning