Journal of Applied Non-Classical Logics 23 (3):229 - 267 (2013)

Dung?s (1995) argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, w.r.t. a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions about the compatibility of the setting with a logical formalism (i.e., whether it is possible to instantiate it properly from a logical knowledge base), and about the significance of the various semantics in the application context. In this paper we tackle the above questions. We first propose to fill in the previous gap by extending Dung?s (1995) framework. The idea is to consider all the ingredients involved in an argumentation process. We start with the notion of an abstract monotonic logic which consists of a language (defining the formulas) and a consequence operator. We show how to build, in a systematic way, arguments from a knowledge base formalised in such a logic. We then recall some basic postulates that any instantiation should satisfy. We study how to choose an attack relation so that the instantiation satisfies the postulates. We show that symmetric attack relations are generally not suitable. However, we identify at least one ?appropriate? attack relation. Next, we investigate under stable, semi-stable, preferred, grounded and ideal semantics the outputs of logic-based instantiations that satisfy the postulates. For each semantics, we delimit the number of extensions an argumentation system may have, characterise the extensions in terms of subsets of the knowledge base, and finally characterise the set of conclusions that are drawn from the knowledge base. The study reveals that stable, semi-stable and preferred semantics either lead to counter-intuitive results or provide no added value w.r.t. naive semantics. Besides, naive semantics either leads to arbitrary results or generalises the coherence-based approach initially developed by Rescher and Manor (1970). Ideal and grounded semantics either coincide and generalise the free consequence relation developed by Benferhat, Dubois, and Prade (1997), or return arbitrary results. Consequently, Dung?s (1995) framework seems problematic when applied over deductive logical formalisms
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1080/11663081.2013.830381
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,577
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

On Inferences From Inconsistent Premises.Nicholas Rescher & Ruth Manor - 1970 - Theory and Decision 1 (2):179-217, 1970-1971.
Argument-Based Extended Logic Programming with Defeasible Priorities.Henry Prakken & Giovanni Sartor - 1997 - Journal of Applied Non-Classical Logics 7 (1-2):25-75.
On the Evaluation of Argumentation Formalisms.Martin Caminada & Leila Amgoud - 2007 - Artificial Intelligence 171 (5-6):286-310.

View all 13 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analogy Argumentation in Law: A Dialectical Perspective. [REVIEW]Harm Kloosterhuis - 2000 - Artificial Intelligence and Law 8 (2-3):173-187.
Law, Logic, Rhetoric: A Procedural Model of Legal Argumentation.Arno R. Lodder - 2004 - In S. Rahman (ed.), Logic, Epistemology, and the Unity of Science. Dordrecht: Kluwer Academic Publishers. pp. 569--588.


Added to PP index

Total views
63 ( #184,923 of 2,533,585 )

Recent downloads (6 months)
1 ( #390,861 of 2,533,585 )

How can I increase my downloads?


My notes