A dynamic metalogic argumentation framework implementation

作者: Jenny S. Z. Eriksson Lundström , Giacomo Aceto , Andreas Hamfelt

DOI: 10.1007/978-3-642-22546-8_8

关键词: MetalogicArgumentProgramming languageDefeasible estateTheoretical computer scienceArgumentation frameworkGame treeTree (data structure)Computer scienceSoftwareArgumentation theory

摘要: One of the main challenges that faces AI-community is to express close approximations human reasoning as computational formalizations argument. In this paper we present a full implementation and accompanying software for defeasible adversarial argumentation. The work based on metalogic framework argumentation games [9]. developed consists of: meta-interpreter, declarative game model graphical interface in Java shows results execution construction derivation tree.

参考文章(33)
Henry Prakken, Giovanni Sartor, Modelling Reasoning with Precedents in a Formal Dialogue Game Artificial Intelligence and Law. ,vol. 6, pp. 127- 183 ,(1998) , 10.1007/978-94-015-9010-5_5
Gerhard Brewka, A reconstruction of rescher's theory of formal disputation based on default logic european conference on artificial intelligence. pp. 366- 370 ,(1994)
David Billington, The proof algorithms of plausible logic form a hierarchy australasian joint conference on artificial intelligence. ,vol. 3809, pp. 796- 799 ,(2005) , 10.1007/11589990_83
Holger Sturm, Nobu-Yuki Suzuki, Frank Wolter, Michael Zakharyaschev, Semi-qualitative Reasoning about Distances: A Preliminary Report Springer US. pp. 37- 56 ,(2000) , 10.1007/3-540-40006-0_4
Dov M. Gabbay, J. A. Robinson, C. J. Hogger, Handbook of logic in artificial intelligence and logic programming (vol. 1) Oxford University Press, Inc.. ,(1993)
André Vellino, Michael A. Covington, Donald Nute, Prolog Programming in Depth ,(1988)
G. Antoniou, G. Governatori, D. Billington, A. Rock, M. J. Maher, A family of defeasible reasoning logics and its implementation european conference on artificial intelligence. ,vol. 54, pp. 459- 463 ,(2000)