ISSN:
1572-8374
Keywords:
Dialectic
;
debate
;
resource-bounded defasible reasoning
;
anytime reasoning
;
symbolic calculus
;
symbolic logic
Source:
Springer Online Journal Archives 1860-2000
Topics:
Linguistics and Literary Studies
Notes:
Abstract 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00721964
Permalink
