Metraipolis › archive › dc_92e27b37583f
Pairwise Logical Selection of Enthymeme Completions under Semantic-Link Uncertainty — arXiv:2608.18820
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18820
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:44:36.916Z
- SHA-256 of the archived text
c14aca5290e6ba944a821ea7038974cae27a07e88a5ecb9f60ae0f2e2c7a0fa3- Stable URL of this page
https://metraipolis.com/documento/dc_92e27b37583f
How to cite
Pairwise Logical Selection of Enthymeme Completions under Semantic-Link Uncertainty — arXiv:2608.18820 — arXiv (en), https://arxiv.org/abs/2608.18820 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_92e27b37583f (Metraipolis archive dc_92e27b37583f, sha256 c14aca5290e6ba944a821ea7038974cae27a07e88a5ecb9f60ae0f2e2c7a0fa3)
BibTeX
@misc{dc92e27b37583f,
title = {Pairwise Logical Selection of Enthymeme Completions under Semantic-Link Uncertainty — arXiv:2608.18820},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18820},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_92e27b37583f; sha256 c14aca5290e6ba944a821ea7038974cae27a07e88a5ecb9f60ae0f2e2c7a0fa3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18820. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Arguments often omit premises or claims, forming enthymemes. We study pairwise logical selection between two candidates for the omitted component. Existing natural language methods can identify or generate candidates but often do not expose how the selected candidate completes the inference, while logic-based approaches usually assume that the required formulae and background knowledge are available. We extend a prior neuro-symbolic pipeline from missing-premise to missing-claim selection and replace binary entailment outcomes with logical-resistance scores. Top-Link uses weighted Partial MaxSAT under a single configuration of highest-confidence semantic links. We then introduce Possible-World Atom-Link Formalization (PWAL), which keeps translated formulae fixed and marginalizes logical resistance over alternative cross-formula semantic-link configurations. We evaluate PWAL on five tasks: ARCT and a CDED-derived task for missing-premise selection, iDebate- and AAE2-derived tasks for missing-claim selection, and alphaNLI for abductive hypothesis selection. Relative to Top-Link, PWAL raises strict accuracy by 2.95-30.86 percentage points and reduces tie rates by 4.57-58.00 percentage points on all five tasks. When ties receive half credit, accuracy still increases by 0.45-6.04 percentage points. PWAL also records the translated formulae, sampled link configurations, and resistance components for every comparison, providing a transparent trace of each score. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.18820 — 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-18T13:41:17.877Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).