将论证文本转化为带语义属性的图形化知识图谱,支持推理与结构分析。
AKReF: An argumentative knowledge representation framework for structured argumentation
- 基于论点组件与关系标注,构建带元数据的论证知识库。
- 通过模态命题与标记识别,显式表达隐含推理与攻击关系。
- 适用于论证一致性检验、冲突消解等复杂分析任务。
本文提出一种论证知识表示框架(AKReF),将论证文本转化为论证知识图(AKG)。该框架从基本的论点成分(ACs)和论证关系(ARs)标注出发,构建包含节点元数据的知识库图(KB)。利用模态命题(modus ponens)与知识库中的推理规则生成论证,并在此基础上构建AKG。AKG的节点与边携带关键论证特征,如前提类型(公理、普通前提、假设)、推理规则类型(严格、可废止)、可废止规则偏好顺序、推理标记(如“因此”、“然而”)及攻击类型(如削弱、反驳、瓦解)。通过识别特定的推理标记(IM),可检测此前数据集中未被发现的削弱攻击。此结构为论证一致性检查与修订机会识别奠定基础,尤其有助于学习需跨论证推断的间接关系。以AAEC数据集中的文章为例说明框架应用,并进一步展示其在提取无冲突集合与最大可接受论证集中的有效性。
原文摘要 · Abstract (English)
This paper presents a framework to convert argumentative texts into argument knowledge graphs (AKG). The proposed argumentative knowledge representation framework (AKReF) extends the theoretical foundation and enables the AKG to provide a graphical view of the argumentative structure that is easier to understand. Starting with basic annotations of argumentative components (ACs) and argumentative relations (ARs), we enrich the information by constructing a knowledge base (KB) graph with metadata attributes for nodes. Next, we apply modus ponens on premises and inference rules from the KB to form arguments. From these arguments, we create an AKG. The nodes and edges of the AKG have attributes capturing key argumentative features such as the type of premise (e.g., axiom, ordinary premise, assumption), the type of inference rule (e.g., strict, defeasible), preference order over defeasible rules, markers (e.g., "therefore", "however"), and the type of attack (e.g., undercut, rebuttal, undermining). We identify inference rules by locating a specific set of markers, called inference markers (IM). This, in turn, makes it possible to identify undercut attacks previously undetectable in existing datasets. AKG prepares the ground for reasoning tasks, including checking the coherence of arguments and identifying opportunities for revision. For this, it is essential to find indirect relations, many of which are implicit. Our proposed AKG format, with annotated inference rules and modus ponens, helps reasoning models learn the implicit, indirect relations that require inference over arguments and their interconnections. We use an essay from the AAEC dataset to illustrate the framework. We further show its application in complex analyses such as extracting a conflict-free set and a maximal set of admissible arguments.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。