ABD: Default Exception Abduction in Finite First Order Worlds
Not on the map. Why?
Abstract (arXiv)
We introduce ABD, a benchmark for default-exception abduction over finite first-order worlds. Given a background theory with an abnormality predicate and a set of relational structures, a model must output a first-order formula that defines exceptions, restoring satisfiability while keeping exceptions sparse. We formalize three observation regimes (closed-world, existential completion, universal completion) with exact SMT verification. Evaluating ten frontier LLMs on 600 instances, the best models achieve high validity but parsimony gaps remain, and holdout evaluation reveals distinct generalization failure modes across regimes.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 39 references that are in the map. First posted on arXiv 21 Feb 2026.
Builds on
8 of 39 references.
References · 8
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2023Faith and Fate: Limits of Transformers on Compositionalitycited by 496
- 2020ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Languagecited by 309
- 2019Abductive Commonsense Reasoningcited by 300
- 2020Transformers as Soft Reasoners over Languagecited by 265
- 2019Learning to Prove Theorems via Interacting with Proof Assistantscited by 107
- 2019Learning higher-order logic programscited by 11
Built on by
Not cited yet.