Metraipolis › archive › dc_f99666c4518d
Autoformalizing Argumentative Material Inferences — arXiv:2609.16991
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16991
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T19:19:23.301Z
- SHA-256 of the archived text
92870430e7d4ab68a28dd75281872d4fc6d6de8f6469e7baa1a40328f0e94f7e- Stable URL of this page
https://metraipolis.com/documento/dc_f99666c4518d
How to cite
Autoformalizing Argumentative Material Inferences — arXiv:2609.16991 — arXiv (en), https://arxiv.org/abs/2609.16991 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f99666c4518d (Metraipolis archive dc_f99666c4518d, sha256 92870430e7d4ab68a28dd75281872d4fc6d6de8f6469e7baa1a40328f0e94f7e)
BibTeX
@misc{dcf99666c4518d,
title = {Autoformalizing Argumentative Material Inferences — arXiv:2609.16991},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16991},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f99666c4518d; sha256 92870430e7d4ab68a28dd75281872d4fc6d6de8f6469e7baa1a40328f0e94f7e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16991. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Natural language arguments are compelling before they are formally explicit. A premise supports a claim through defeasible warrants, background commitments, and exception conditions that the text leaves implicit. However, formal verification requires the opposite. Making such arguments machine-checkable requires constructing the missing commitments, not only translating given sentences into logic. Construction, however, carries a risk that translation does not: a system free to add premises can make any claim provable, and a formally valid proof may assert the claim outright, prove it without the original premise, or establish more than the claim itself. We address this problem by formulating autoformalization for argumentative material inference as guard completion, in which non-monotonic material support is turned into monotonic formal inference relative to an explicitly constructed guard set. A completion is accepted only when its proof both passes the theorem prover and survives contrastive tests of premise dependence and claim selectivity. We implement this formulation in GUARD, a neuro-symbolic framework in which LLMs construct and formalize candidate guards, Isabelle/HOL verifies the resulting theories and returns step-level feedback for iterative refinement, and the system abstains when no faithful completion can be reached. Our empirical results on Debatepedia and ARCT using different LLMs demonstrate that GUARD yields significant improvements in verified-faithful (+35.3, +32.9 points) and substantial reductions in leakage (-25.9, -21.9 points) over the state-of-the-art LLM-driven theorem proving approach. Moreover, we show that the symbolic soft critique and the explicit assumption layer account for most of these gains, with the soft critique also improving the initial validity of the elicited context and reducing the number of iterations required for successful verification. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-16 in cs.CL). Categorie arXiv: Computation and Language (cs.CL). Pagina del lavoro: https://arxiv.org/abs/2609.16991 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T18:32:32.850Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).