Metraipolis › archive › dc_02bb4ceb7e44
ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning — arXiv:2609.38409
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38409
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T12:41:49.541Z
- SHA-256 of the archived text
09868b38594c19d32092c3d2d9b8b859b2728a8356f841cb19544dee2bb31245- Stable URL of this page
https://metraipolis.com/documento/dc_02bb4ceb7e44
How to cite
ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning — arXiv:2609.38409 — arXiv (en), https://arxiv.org/abs/2609.38409 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_02bb4ceb7e44 (Metraipolis archive dc_02bb4ceb7e44, sha256 09868b38594c19d32092c3d2d9b8b859b2728a8356f841cb19544dee2bb31245)
BibTeX
@misc{dc02bb4ceb7e44,
title = {ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning — arXiv:2609.38409},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38409},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_02bb4ceb7e44; sha256 09868b38594c19d32092c3d2d9b8b859b2728a8356f841cb19544dee2bb31245},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38409. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recent progress in large language model reasoning has been driven by benchmarks and reinforcement learning environments with automatically verifiable rewards, particularly in mathematics, code, and formal logic. These settings make model accuracy easier to evaluate and optimize, but it remains unclear how far success under fixed problem specifications and stable evaluation criteria transfers to reasoning outside such domains. Real-world reasoning often proceeds under incomplete and revisable information: conclusions may be supported provisionally, defeated by counter-evidence, reinstated by further arguments, or revised when stronger reasons become available. Reasoning of this kind is generally referred to as defeasible reasoning. We introduce ArgGYM, a procedural benchmark and RLVR-compatible training environment for structured defeasible reasoning. ArgGYM decomposes this reasoning into twelve tasks and grounds task-specific scoring in a symbolic argumentation engine that computes the formal states used to evaluate model outputs. It includes a frozen benchmark of 1,440 verified instances across fifteen curriculum configurations, two argument preference orderings (weakest-link and last-link), and two set orderings (elitist and democratic), while the same generators and verifiers can produce fresh instances for evaluation that reduces dependence on static test sets and for verifiable-reward training. On the frozen benchmark, frontier and open-weight models show sharply different reasoning profiles: they can recover substantial parts of structured answers without solving the complete task, and performance declines in later curriculum configurations with longer dependencies and more interacting structures. We release the benchmark, generators, and verifiers for reproducible evaluation and RLVR training. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Computation and Language (cs.CL). Pagina del lavoro: https://arxiv.org/abs/2609.38409 — 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-07T12:14:13.624Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).