Computer Science ›› 2020, Vol. 47 ›› Issue (5): 27-31.doi: 10.11896/jsjkx.200200052

Special Issue: Theoretical Computer Scinece

• Theoretical Computer Science • Previous Articles     Next Articles

On Logic of Graded Argumentation System

TAN Li-xing1,2, WANG Fu-jun1   

  1. 1 College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China
    2 Taizhou Institute of Science and Technology,Nanjing University of Science and Technology,Taizhou,Jiangsu 225300,China
  • Received:2020-02-11 Online:2020-05-15 Published:2020-05-19
  • About author:TAN Li-xing,born in 1987,Ph.D student,lecturer.His main research interests include artificial intelligence and logic in computer science.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61602249)

Abstract: In recent years,formal argumentation has gradually become one of the research hotspots in the field of artificial intelligence.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 formalized 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.

Key words: DAS, Formal argumentation, GML, Graded argumentation system, Graded bisimulation

CLC Number: 

  • TP181
[1]GAGGL S A,LINSBICHLER T,MARATEA M,et al.Designand Results of the Second International Competition on Computational Models of Argumentation[J].Artificial Intelligence,2020,279:103193.
[2]FERMÉ E,SIMARI G R.Introduction to the special issue on belief revision,argumentation,ontologies,and norms[J].Annals of Mathematics and Artificial Intelligence,2019,87(3):185-186.
[3]DUNG P M.On the acceptability of arguments and its fundamental role in nonmonotonic reasoning,logic programming and n-person games[J].Artificial Intelligence,1995,77(2):321-357.
[4]BENCH-CAPON T J M,DUNNE P E.Argumentation in artificial intelligence[J].Artificial Intelligence,2007,171(10/11/12/13/14/15):619-641.
[5]LIAO B S.Dynamics of Argumentation Systems and Its Re-search Development[J].Journal of Software,2012,23(11):2871-2884.
[6]PRAKKEN H,SARTOR G.Law and logic:A review from an argumentation perspective[J].Artificial Intelligence,2015,227:214-245.
[7]HUNTER A,WILLIAMS M.Aggregating evidence about the positive and negative effects of treatments[J].Artificial Intelligence in Medicine,2012,56(3):173-190.
[8]SCHNEIDER J,GROZA T,PASSANT A.A review of argu-mentation for the social semantic web[J].Semantic Web,2013,4(2):159-218.
[9]BARONI P,ROMANO M,TONI F,et al.Automatic evaluation of design alternatives with quantitative argumentation[J].Argument & Computation,2015,6(1):24-49.
[10]ATKINSON K,BARONI P,GIACOMIN M,et al.Towards artificial argumentation[J].AI Magazine,2017,38(3):25-36.
[11]BESNARD P,GARCIA A,HUNTER A,et al.Introduction to structured argumentation[J].Argument & Computation,2014,5(1):1-4.
[12]BARONI P,CAMINADA M,GIACOMIN M.An introductionto argumentation semantics[J].The Knowledge Engineering Review,2011,26(4):365-410.
[13]OIKARINEN E,WOLTRAN S.Characterizing strong equivalence for argumentation frameworks[J].Artificial intelligence,2011,175(14/15):1985-2009.
[14]BAUMANN R,DVOčÁK W,LINSBICHLER T,et al.A gene-ral notion of equivalence for abstract argumentation[J].Artificial Intelligence,2019,275:379-410.
[15]BAUMANN R.Normal and strong expansion equivalence forargumentation frameworks[J].Artificial Intelligence,2012,193:18-44.
[16]GROSSI D.On the logic of argumentation theory[C]//Procee-dings of the 9th International Conference on Autonomous Agents and Multiagent Systems.2010:409-416.
[17]GROSSI D.Abstract argument games via modal logic[J].Synthese,2013,190(1):5-29.
[18]GROSSI D,MODGIL S.On the graded acceptability of arguments in abstract and instantiated argumentation[J].Artificial Intelligence,2019,275:138-173.
[19]MA M H.Toward Model-Theoretic Modal Logics[J].Studies in Logic,2009,2(1):62-77.
[20]GOBLE L F.Grades of modality[J].Logique et Analyse,1970,13(51):323-334.
[21]DE RIJKE M.A note on graded modal logic[J].Studia Logica,2000,64(2):271-283.
[1] LAI Xin, ZENG Ji-wei. Study on Mapping Transformation from Geometric Aviation Data to Relational Database [J]. Computer Science, 2020, 47(11A): 570-572.
[2] LI Zong-xin, QIN Bo, WANG Meng-qian. Real-time Detection and Recognition of Traffic Light Based on Time-Space Model [J]. Computer Science, 2018, 45(6): 314-319.
[3] CHEN Han-shen, YAO Ming-hai, CHEN Zhi-hao, YANG Zhen. Efficient Method of Lane Detection Based on Multi-frame Blending and Windows Searching [J]. Computer Science, 2018, 45(10): 255-260.
[4] ZHU Jie and HONG Jun-jian. Research on Method of Personal Relation Extraction under SDAs [J]. Computer Science, 2017, 44(Z6): 141-145.
[5] XIONG Li-rong, LEI Jing-zhi and JIN Xin. Hybrid Rate Adaptation Algorithm for Adaptive HTTP Streaming [J]. Computer Science, 2017, 44(2): 129-134.
[6] XU Bin and GUAN Ji-hong. GML Parallel Query Based on MapReduce [J]. Computer Science, 2013, 40(11): 203-207.
[7] . [J]. Computer Science, 2009, 36(1): 96-100.
[8] WANG Wei-Yang JING Xiao (College of Information & Engineering, Shanghai Maritime University, Shanghai 200135). [J]. Computer Science, 2007, 34(4): 126-128.
[9] . [J]. Computer Science, 2007, 34(2): 234-237.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!