A Comparative Study of Some Central Notions of ASPIC+ and DeLP

Author:

GARCÍA ALEJANDRO J.,PRAKKEN HENRYORCID,SIMARI GUILLERMO R.ORCID

Abstract

AbstractThis paper formally compares some central notions from two well-known formalisms for rule-based argumentation, DeLP and ASPIC+. The comparisons especially focus on intuitive adequacy and inter-translatability, consistency, and closure properties. As for differences in the definitions of arguments and attack, it turns out that DeLP’s definitions are intuitively appealing but that they may not fully comply with Caminada and Amgoud’s rationality postulates of strict closure and indirect consistency. For some special cases, the DeLP definitions are shown to fare better than ASPIC+. Next, it is argued that there are reasons to consider a variant of DeLP with grounded semantics, since in some examples its current notion of warrant arguably has counterintuitive consequences and may lead to sets of warranted arguments that are not admissible. Finally, under some minimality and consistency assumptions on ASPIC+ arguments, a one-to-many correspondence between ASPIC+ arguments and DeLP arguments is identified in such a way that if the DeLP warranting procedure is changed to grounded semantics, then ’s DeLP notion of warrant and ASPIC+ ’s notion of justification are equivalent. This result is proven for three alternative definitions of attack.

Publisher

Cambridge University Press (CUP)

Subject

Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software

Reference41 articles.

1. García, A. J. and Simari, G. R. 2014. Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers. Argument and Computation 5, 63–88.

2. García, A. J. 2000. Defeasible Logic Programming: Definition, Operational Semantics and Parallelism. Ph.D. thesis, Computer Science and Engineering Department, Universidad Nacional del Sur, Bahía Blanca, Argentina.

3. Martínez, M. V. , García, A. J. and Simari, G. R. 2012. On the use of presumptions in structured defeasible reasoning. In Computational Models of Argument. Proceedings of COMMA 2012, Verheij, B. , Szeider, S. , and Woltran, S. , Eds. Frontiers in Artificial Intelligence and Applications, vol. 245. IOS Press, 185–196.

4. García, A. J. , Simari, G. R. and Chesñevar, C. I. 1998. An argumentative framework for reasoning with inconsistent and incomplete information. In Proceedings of the ECAI’98 Workshop on Practical Reasoning and Rationality, Brighton, UK.

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Abstract argumentation frameworks with strong and weak constraints;Artificial Intelligence;2024-11

2. Automatic knowledge generation for a persuasion dialogue system with enthymemes;International Journal of Approximate Reasoning;2023-09

3. When is argumentation deductive?;Journal of Applied Non-Classical Logics;2023-08-16

4. Arg2P: an argumentation framework for explainable intelligent systems;Journal of Logic and Computation;2022-01-25

5. Incremental computation for structured argumentation over dynamic DeLP knowledge bases;Artificial Intelligence;2021-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3