Credulous and Sceptical Argument Games for Preferred Semantics
作者： Gerard A. W. Vreeswik , Henry Prakken
关键词:
摘要: This paper presents dialectical proof theories for Dung's preferred semantics of defeasible argumentation. The have the form argument games testing membership some (credulous reasoning) or all extensions (sceptical reasoning). credulous theory is general case, while sceptical version case where coincides with stable semantics. development these especially motivated by applications argumentation in automated negotiation, mediation collective discussion and decision making, intelligent tutoring.
springer.com
core.ac.uk
sci-hub.st 参考文章(31)
Gerhard Brewka, A reconstruction of rescher's theory of formal disputation based on default logic european conference on artificial intelligence. pp. 366- 370 ,(1994)
Harry Timmermans, Decision Support Systems in Urban Planning ,(2003)
Trevor J.M. Bench-Capon, Specification and Implementation of Toulmin Dialogue Game ,(1999)
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Preferred Arguments are Harder to Compute than Stable Extension international joint conference on artificial intelligence. pp. 36- 43 ,(1999)
Thomas F. Gordon, The Pleadings Game: An Artificial Intelligence Model of Procedural Justice ,(1995)
Henry Prakken, Gerard Vreeswijk, Logics for Defeasible Argumentation Springer, Dordrecht. pp. 219- 318 ,(2001) , 10.1007/978-94-017-0456-4_3
Arno R. Lodder, DiaLaw: On Legal Justification and Dialogical Models of Argumentation ,(1999)
Henry Prakken, On Dialogue Systems with Speech Acts, Arguments, and Counterarguments Lecture Notes in Computer Science. pp. 224- 238 ,(2000) , 10.1007/3-540-40006-0_16
John L. Pollock, Cognitive Carpentry: A Blueprint for How to Build a Person ,(1995)
H. Jakobovits, D. Vermeir, Dialectic semantics for argumentation frameworks international conference on artificial intelligence and law. pp. 53- 62 ,(1999) , 10.1145/323706.323715