Dialectical Proofs for Constrained Argumentation

作者: Sylvie Doutre , Caroline Devred , Claire Lefèvre , Pascal Nicolas

DOI: 10.3233/978-1-60750-619-5-159

关键词: Set (abstract data type)Computer scienceConstraint (information theory)Mathematical proofCalculusLogical formulaArgumentation theoryDialecticArtificial intelligenceAnswer set programming

摘要: Constrained argumentation frameworks (CAF) generalize Dung's by allowing additional constraints on arguments to be taken into account in the definition of acceptability arguments. These are expressed means a logical formula which is added framework. The resulting system captures several other extensions original system. To determine if set credulously inferred from CAF, notion dialectical proof (alternating pros and cons arguments) extended for order respect constraint. new constrained proofs computed using Answer Set Programming.

参考文章(24)
Daniel Bryant, Paul J Krause, Gerard Vreeswijk, None, Argue tuProlog: A Lightweight Argumentation Engine for Agent Applications computational models of argument. pp. 27- 32 ,(2006)
Martin Gebser, Benjamin Kaufmann, Torsten Schaub, André Neumann, Conflict-driven answer set solving international joint conference on artificial intelligence. pp. 386- 392 ,(2007)
Sylvie Coste-Marquis, Pierre Marquis, Caroline Devred, Constrained argumentation frameworks principles of knowledge representation and reasoning. pp. 112- 122 ,(2006)
Gerard Vreeswijk, Matthew South, John Fox, Dungine: a Java Dung Reasoner computational models of argument. pp. 360- 368 ,(2008)
Francesca Toni, Dorian Gaertner, Hybrid argumentation and its properties computational models of argument. pp. 183- 195 ,(2008)
P. M. Thang, P. M. Dung, A unified framework for representation and development of dialectical proof procedures in argumentation international joint conference on artificial intelligence. pp. 746- 751 ,(2009)
Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone, Computable Functions in ASP: Theory and Implementation international conference on logic programming. ,vol. 5366, pp. 407- 424 ,(2008) , 10.1007/978-3-540-89982-2_37
Stefan Woltran, Gerhard Brewka, Abstract dialectical frameworks principles of knowledge representation and reasoning. pp. 102- 111 ,(2010)
Bart Verheij, A labeling approach to the computation of credulous acceptance in argumentation international joint conference on artificial intelligence. pp. 623- 628 ,(2007)
Gerard A. W. Vreeswik, Henry Prakken, Credulous and Sceptical Argument Games for Preferred Semantics Lecture Notes in Computer Science. pp. 239- 253 ,(2000) , 10.1007/3-540-40006-0_17