The computational value of debate in defeasible reasoning

Argumentation 9 (2):305-342 (1995)

Defeasible reasoning is concerned with the logics of non-deductive argument. As is described in the literature, the study of this type of reasoning is considerably more involved than the study of deductive argument, even so that, in realistic applications, there is often a lack of resources to perform an exhaustive analysis. It follows that, in a theory of defeasible reasoning, the order and direction in which arguments are developed, i.e. theprocedure, is important. The aim of this article is to show that debate is the most efficient procedure to argue in the presence of limited resources. To do so, there is first some general theory on defeasible argumentation, which is followed by an introduction to the problem of dialectical search. The problem of dialectical search is (or at least, should be) the essential issue in every theory on argumentation, and emerges at every occasion that involves adjudication on competing arguments. Starting with an example, it is explained that dialectical search can be best scheduled according to classical debating techniques, that work along well-tried methods. These methods (which include various forms of curtailment, interruption, and interpretation) have proven their value in keeping debating efforts within reasonable bounds. How they apply in a theory of formal argument, will be shown in this article
Keywords Dialectic  debate  resource-bounded defasible reasoning  anytime reasoning  symbolic calculus  symbolic logic
Categories (categorize this paper)
DOI 10.1007/BF00721964
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 45,328
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

Theory of Knowledge.Roderick M. Chisholm - 1966 - Englewood Cliffs, N.J., Prentice-Hall.
The Development of Logic.W. C. Kneale - 1962 - Oxford University Press.
Knowledge and Justification.John Pollock - 1974 - Princeton University Press.

View all 9 references / Add more references

Citations of this work BETA

An Exercise in Formalising Teleological Case-Based Reasoning.Henry Prakken - 2002 - Artificial Intelligence and Law 10 (1-3):113-133.
Representation of Formal Dispute with Astanding Order.Gerard A. W. Vreeswijk - 2000 - Artificial Intelligence and Law 8 (2-3):205-231.

Add more citations

Similar books and articles

Self-Defeating Arguments.John L. Pollock - 1991 - Minds and Machines 1 (4):367-392.
The Epistemic Basis of Defeasible Reasoning.Robert L. Causey - 1991 - Minds and Machines 1 (4):437-458.
Defeasible Reasoning and Logic Programming.Timothy R. Colburn - 1991 - Minds and Machines 1 (4):417-436.
Defeasible Reasoning in Japanese Criminal Jurisprudence.Katsumi Nitta & Masato Shibasaki - 1997 - Artificial Intelligence and Law 5 (1-2):139-159.
Abstract Argumentation.Robert A. Kowalski & Francesca Toni - 1996 - Artificial Intelligence and Law 4 (3-4):275-296.


Added to PP index

Total views
18 ( #496,345 of 2,280,259 )

Recent downloads (6 months)
1 ( #830,174 of 2,280,259 )

How can I increase my downloads?


My notes

Sign in to use this feature