arXiv:2605.20098cs.AI2026-05被引 2

用可解释的论证框架实现三元判断,让模型推理过程透明可信。

Neurosymbolic Learning for Inference-Time Argumentation

论文配图:Neurosymbolic Learning for Inference-Time Argumentation
图 1 · 摘自论文原文
  • 训练时通过论证语义指导模型生成并评分论据,提升推理质量。
  • 在两个数据集上表现优于基准模型,三元判断准确率显著提升。
  • 适合需要可解释性与高可信度的医疗、金融等关键场景。

主张验证是医疗和金融等高风险领域的重要问题。当支持主张的信息不完整或存在冲突时,给出不确定结论比二元真假判断更合理。在此情况下,忠实呈现决定最终裁决的考量因素至关重要。本文提出推理时论证(ITA),一种可训练的神经符号框架,用于三元主张验证。该框架利用形式化论证语义来衡量主张强度,既在训练阶段引导大模型生成论据并赋予其基础得分(反映内在强度),又在推理阶段基于生成的带分论据计算三元(真/假/不确定)预测。因此,训练时可通过诱导出的论证预测质量优化论据生成与评分;推理时,最终判断天然忠实于决定裁决的论据与得分结构,而非依赖可能失真的事后推理路径。实验表明,在两个三元主张验证数据集上,ITA优于现有论证基线,并可媲美非论证型直接预测基线,同时提供由显式、可检查论证结构确定性生成的判决结果。

原文摘要 · Abstract (English)

Claim verification is an important problem in high-stakes settings, including health and finance. When information underpinning claims is incomplete or conflicting, uncertain answers may be more appropriate than binary true or false classifications. In all cases, faithful explanations of the considerations determining the final verdict are crucial. We introduce inference-time argumentation (ITA), a trainable neurosymbolic framework for ternary claim verification in which a formal argumentation semantics giving the strength of claims is used both (i) to guide LLM training as models learn to generate arguments and assign them base scores (representing intrinsic strengths) and (ii) to compute ternary (true/false/uncertain) predictions from generated, scored arguments. As a result, at training time, argument generation and scoring can be optimised according to the quality of the induced argumentative predictions. Moreover, at inference time, the final prediction is faithful, by construction, to the arguments and scores determining the verdict, rather than being justified by a potentially unfaithful post-hoc reasoning trace as in conventional reasoning models. We finally show that, on two datasets for ternary claim verification, ITA improves upon argumentative baselines and can perform competitively against non-argumentative direct-prediction baselines, while providing verdicts that are computed deterministically from explicit, inspectable argumentative structures.

主张验证可解释性神经符号

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。