检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谭立兴 王福俊[1] TAN Li-xing;WANG Fu-jun(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China;Taizhou Institute of Science and Technology,Nanjing University of Science and Technology,Taizhou,Jiangsu 225300,China)
机构地区:[1]南京航空航天大学计算机科学与技术学院,南京211106 [2]南京理工大学泰州科技学院,江苏泰州225300
出 处:《计算机科学》2020年第5期27-31,共5页Computer Science
基 金:国家自然科学基金(61602249)。
摘 要:近年来,形式论证已逐渐成为人工智能领域的研究热点之一。自Dung于1995年提出抽象辩论框架起,学术界普遍认为论辩的核心任务是在各种基于外延的语义下对论点集进行评估,以确定其辩护状态。分级论辩系统(Graded Argumentation System,GAS)是对经典Dung型论辩系统(Dung-style Argumentation System,DAS)的推广,通过一般化DAS语义的两个核心性质,即无冲突性和可接受性,来提供更细化的论点状态概念。当前的论辩系统语义等效性研究主要集中在框架和论点层次上,可为其结构约简提供有力的保证。针对两个不同分级论辩系统中论点的语义等效问题,首先运用分级模态逻辑(Graded Modal Logic,GML)形式化分级论辩系统的片段,然后建立并证明了分级论辩系统基于外延的语义和GML公式之间的一一对应关系,最后定义分级互模拟关系并证明其蕴含分级论辩系统的4个重要的语义等价性。In recent years,formal argumentation has gradually become one of the research hotspots in the field of artificial intelli-gence.Since Dung put forward the abstract argumentation framework in 1995,it is generally accepted in the academic circles that the core task of argumentation is to evaluate a set of arguments under various extension-based semantics,so as to determine their justification status.Graded argumentation system(GAS)is a generalization of the classical Dung-style Argumentation System(DAS),which provides a more fine-grained notion of argument status by generalizing the two core principles of DAS semantics,conflict-free and acceptability.The current research on semantic equivalence of argumentation system mainly focuses on the framework and argument level,which can provide powerful support for its structural reduction.For the semantic equivalence of the arguments in two different graded argumentation systems,firstly,fragments of the graded argumentation system are formal-ized by using Graded Modal Logic(GML).Then,the one-to one correspondence between the extension-based semantics and GML formula in graded argumentation system is established and proved.Finally,the graded bisimulation relation is defined and that it implies four prominent semantic equivalences of GAS is proved.
关 键 词:形式论证 DAS 分级论辩系统 GML 分级互模拟
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.248.121