ZebraLogic: On the Scaling Limits of LLMs for Logical Reasoning
Authors: Bill Yuchen Lin, Ronan Le Bras, Kyle Richardson, Ashish Sabharwal, Radha Poovendran, Peter Clark, Yejin Choi
AI-generated Key Points
- The study explores logical reasoning capabilities of large language models (LLMs) and their scalability in handling complex non-monotonic reasoning tasks.
- Utilizing ZebraLogic as an evaluation framework, the research focuses on assessing LLM performance on logic grid puzzles derived from constraint satisfaction problems (CSPs).
- ZebraLogic enables a systematic exploration of scaling limits of models such as Llama, o1 models, and DeepSeek-R1 by generating puzzles with varying complexity levels.
- The decline in performance persists even with larger models and increased inference-time computation, indicating inherent limitations in current LLM reasoning capabilities.
- Strategies to enhance logical reasoning include Best-of-N sampling, backtracking mechanisms, and self-verification prompts.
- Neuro-symbolic systems like CLOVER integrate LLMs with symbolic solvers to enhance problem-solving abilities across various domains.
- The study offers critical insights into the scalability of LLM reasoning by highlighting fundamental limitations and outlining potential directions for improvement.
Abstract: We investigate the logical reasoning capabilities of large language models (LLMs) and their scalability in complex non-monotonic reasoning. To this end, we introduce ZebraLogic, a comprehensive evaluation framework for assessing LLM reasoning performance on logic grid puzzles derived from constraint satisfaction problems (CSPs). ZebraLogic enables the generation of puzzles with controllable and quantifiable complexity, facilitating a systematic study of the scaling limits of models such as Llama, o1 models, and DeepSeek-R1. By encompassing a broad range of search space complexities and diverse logical constraints, ZebraLogic provides a structured environment to evaluate reasoning under increasing difficulty. Our results reveal a significant decline in accuracy as problem complexity grows -- a phenomenon we term the curse of complexity. This limitation persists even with larger models and increased inference-time computation, suggesting inherent constraints in current LLM reasoning capabilities. Additionally, we explore strategies to enhance logical reasoning, including Best-of-N sampling, backtracking mechanisms, and self-verification prompts. Our findings offer critical insights into the scalability of LLM reasoning, highlight fundamental limitations, and outline potential directions for improvement.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.