From Errors to Proofs: Minimal-Core-Guided Repair for Neuro-Symbolic Constraint Solving
Making language models solve constraint problems reliably often means having them translate the problem into a formal specification and delegating the search to a sound solver. But the translation is itself a language-model task, and an unfaithful translation makes the solver faithfully solve the wrong problem. Existing pipelines repair only translations that crash, returning the solver's error message and falling silent when the program runs but is wrong. We replace the error message with a proof: when the generated program is unsatisfiable, we extract a minimal unsatisfiable core over the model's own constraints and hand it back the exact set that cannot hold together, a leakage-free si...
| Authors | Dipankar Sarkar |
|---|---|
| Primary category | cs.AI |
| Published | 14 August 2026 |
| Last updated at source | 14 August 2026 |
Connected in the knowledge graph
- skelfresearch/minimal-core-benchmarkDataset · cited by
Models and datasets referencing this paper
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.