This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes is built.

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes is built.

This paper makes an independent start with formalizing the rules for the argumentation stage of critical discussions. It does not deal with the well-known code of conduct consisting of ten rules but with the system consisting of fifteen rules on which the code of conduct is based. The rules of this system are scrutinized and problems they raise are discussed. Then a formal dialectical system is defined that reflects most of the contents of these rules. The aim is to elucidate (...) the way the rules work and to show how a formal approach can be useful to achieve this. It is also shown how the present method can be used to study the nature of circular argumentation. While, generally, the formalization follows closely the original rules for the argumentation stage of critical discussions, there will also be proposed some modifications of the original protocol. (shrink)

The thesis of the paper holds that some future developments of argumentation theory may be inspired by the rich logico-methodological legacy of the Lvov–Warsaw School (LWS), the Polish research movement that was most active from 1895 to 1939. As a selection of ideas of the LWS which exploit both formal and pragmatic aspects of the force of argument, we present: Ajdukiewicz’s account of reasoning and inference, Bocheński’s analyses of superstitions or dogmas, and Frydman’s constructive approach to legal interpretation. This paper (...) does not aim at exhaustive elaboration of any of these topics or their usefulness in current discussions within argumentation theory. Rather, we intend to indicate chosen directions of a potentially fruitful research program for the emerging Polish School of Argumentation which would consist in application of methods and conceptions elaborated by the LWS to selected open problems of contemporary research on argumentation. (shrink)

This paper presents a dialogue system called Lorenzen–Hamblin Natural Dialogue (LHND), in which participants can commit formal fallacies and have a method of both identifying and withdrawing formal fallacies. It therefore provides a tool for the dialectical evaluation of force of argument when players advance reasons which are deductively incorrect. The system is inspired by Hamblin’s formal dialectic and Lorenzen’s dialogical logic. It offers uniform protocols for Hamblin’s and Lorenzen’s dialogues and adds a protocol for embedding them. This unification required (...) a reformulation of the original description of Lorenzen’s system to distinguish “between different stances that a person might take in the discussion”, as suggested by Hodges. The LHND system is compared to Walton and Krabbe’s Complex Persuasion Dialogue using an example of a dialogue. (shrink)

To adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them, as well as inferences drawn about these objects and relationships as the discourse unfolds. We introduce a framework with these properties, which has been used to analyse mathematical dialogues and expository texts. The framework can recover salient elements of discourse at, and within, the sentence level, as well as the way mathematical content connects to form larger argumentative structures. (...) We show how the framework might be used to support computational reasoning, and argue that it provides a more natural way to examine the process of proving theorems than do Lamport’s structured proofs. (shrink)