Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Assessing the epistemological relevance of Dung-style argumentation theories
Betz G. Annals of Mathematics and Artificial Intelligence78 (3-4):303-321,2016.Type:Article
Date Reviewed: May 11 2017

Phan Minh Dung described a model for argumentation in Artificial Intelligence in 1995 [1]. The model presents an argument framework as a collection of arguments together with an attack-relation defined on the set. A single argument A is acceptable if every argument that attacks A is itself attacked in the set. A set of arguments is admissible if and only if it is conflict free and every argument it contains is admissible.

This paper, while not criticizing the structural concept of Dung’s argument framework, uses examples to show that the framework is epistemologically flawed. Two kinds of examples are presented to show this. In the first example, the author shows that Dung’s principles are in conflict with the principle of judgment suspension where an argument is neither supported nor attacked in the framework, so that a principal would suspend judgment on this argument. In the second example, the author shows that the knowledge base interpretation of an argument framework fails to take into account that a rational agent must take into account foreign arguments that cannot be constructed from the proponent’s knowledge base.

The examples are lucidly explained and the paper poses an interesting challenge to a much-used construct.

Reviewer:  J. P. E. Hodgson Review #: CR145267 (1707-0473)
1) Dung, P. H. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 2(1995), 321–357.
Bookmark and Share
  Editor Recommended
Featured Reviewer
 
 
Rational Approximation (G.1.2 ... )
 
 
Artificial Intelligence (I.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Rational Approximation": Date
Approximation of nonlinear dynamic systems by rational series
Hespel C., Jacob G. Theoretical Computer Science 79(1): 151-162, 1991. Type: Article
Dec 1 1991
On a rational approximation problem in the real Hardy space H2
Baratchart L., Olivi M., Wielonsky F. Theoretical Computer Science 94(2): 175-197, 1992. Type: Article
Jun 1 1993
Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
Cabay S., Jones A., Labahn G. ACM Transactions on Mathematical Software 23(1): 91-110, 1997. Type: Article
Sep 1 1997
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy