arXiv:2603.02858cs.AI2026-03

用逻辑框架让大模型读懂辩论中的支持与攻击关系

LLM-based Argument Mining meets Argumentation and Description Logics: a Unified Framework for Reasoning about Debates

  • 将辩论文本转为带支持/攻击关系的模糊知识图谱
  • 通过量化推理计算论点最终可信度,结果可解释
  • 支持复杂查询,适合需要透明推理的场景

大语言模型在文本分析上表现优异,但在处理辩论类复杂文本时缺乏透明、可验证的推理能力,尤其缺少对论点间支持与攻击关系的结构化表达及其强度评估。本文提出一个统一框架,融合基于学习的论点挖掘与量化推理及本体查询。从原始辩论文本出发,框架提取一个模糊论点知识库:论点作为实体,通过支持与攻击关系连接,并标注初始模糊强度以反映其在语境中的可信度。随后应用量化论点语义,通过传播支持与攻击效应计算最终论点强度。结果嵌入模糊描述逻辑系统,支持高效重写技术的丰富查询。该方法提供透明、可解释且形式化可靠的辩论分析路径,克服了纯统计型大模型分析的局限。

原文摘要 · Abstract (English)

Large Language Models (LLMs) achieve strong performance in analyzing and generating text, yet they struggle with explicit, transparent, and verifiable reasoning over complex texts such as those containing debates. In particular, they lack structured representations that capture how arguments support or attack each other and how their relative strengths determine overall acceptability. We encompass these limitations by proposing a framework that integrates learning-based argument mining with quantitative reasoning and ontology-based querying. Starting from a raw debate text, the framework extracts a fuzzy argumentative knowledge base, where arguments are explicitly represented as entities, linked by attack and support relations, and annotated with initial fuzzy strengths reflecting plausibility w.r.t. the debate's context. Quantitative argumentation semantics are then applied to compute final argument strengths by propagating the effects of supports and attacks. These results are then embedded into a fuzzy description logic setting, enabling expressive query answering through efficient rewriting techniques. The proposed approach provides a transparent, explainable, and formally grounded method for analyzing debates, overcoming purely statistical LLM-based analyses.

辩论分析逻辑推理可解释性知识图谱

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