This book provides a systematic analysis of many common argumentation schemes and a compendium of 96 schemes. The study of these schemes, or forms of argument that capture stereotypical patterns of human reasoning, is at the core of argumentation research. Surveying all aspects of argumentation schemes from the ground up, the book takes the reader from the elementary exposition in the first chapter to the latest state of the art in the research efforts to formalize and classify the schemes, outlined (...) in the last chapter. It provides a systematic and comprehensive account, with notation suitable for computational applications that increasingly make use of argumentation schemes. (shrink)

Formal dialogue games have been studied in philosophy since at least the time of Aristotle. Recently they have been applied in various contexts in computer science and artificial intelligence, particularly as the basis for interaction between autonomous software agents. We review these applications and discuss the many open research questions and challenges at this exciting interface between philosophy and computer science.

This essay proposes and defends a general thesis concerning the nature of fallacies of reasoning. These in distinctive ways are all said to be deductively invalid. More importantly, the most accurate, complete and charitable reconstructions of these species and specimens of the informal fallacies are instructive with respect to the individual character of each distinct informal fallacy. Reconstructions of the fallacies as deductive invalidities are possible in every case, if deductivism is true, which means that in every case they should (...) be formalizable in an expressively comprehensive formal symbolic deductive logic. The general thesis is illustrated by a detailed examination of Walter Burleigh's paradox in his c. 1323 work, De Puritate Artis Logicae Tractatus Longior (Longer Treatise on the Purity of Logic), as a challenge to the deductive validity of hypothetical syllogism. The paradox has the form, ‹If I call you a swine, then I call you an animal; if I call you an animal, then I speak truly; therefore, if I call you a swine, then I speak truly'. Several solutions to the problem are considered, and the inference is exposed as an instance of the common deductive fallacy of equivocation. (shrink)

The Pleadings Game is a major contribution to artificial intelligence and legal theory. The book draws on jurisprudence and moral philosophy to develop a formal model of argumentation called the pleadings game. From a technical perspective, the work can be viewed as an extension of recent argumentation-based approaches to non-monotonic logic: (1) the game is dialogical rather than mono-logical; (2) the validity and priority of defeasible rules is subject to debate; and (3) resource limitations are acknowledged by rules for fairly (...) dividing the burdens of representation and proof among the players. Gordon's work evaluates important jurisprudential theories of argumentation and reasoning in the context of the U.S. commercial law on secured transactions. Audience: It is not necessary to have a formal background in law to appreciate The Pleadings Game. It will be of equal interest to both the artificial intelligence community and legal theorists. (shrink)

In the paper, certain rational postulates for protocols describing real communicating are introduced.These rational postulates, on the one hand, allow assigning a certain typology of real systems of interactions, which is consistent with the reality of epistemic argumentation in systems of communicating, and on the other one – defining rules of using argumentation in real situations. Moreover, the presented postulates for protocols characterize information networks and administering knowledge in real interactivity systems. Due to the epistemic character of the considerations, the (...) problem undertaken in the paper concerns working out fundamental assumptions that refer to building of epistemic logics. They allow establishing the correctness of the discourse defined by rational postulates of protocols of real communication. In the context of the presented problem there are the following two research questions distinguished: 1) How do we determine the rule of building of real dynamic epistemic logics? and 2) How should we define semantics for these logics? Within the framework of considerations relating to the research questions asked, certain epistemic operators, relativized to types of communicating, are introduced. Basic logical relations between using these operators are established for these operators. The relations are presented by a diagram called the square of epis temic operators. On the basis of these logical relations some axioms for real dynamic epistemic logics are presented. The semantics of real dynamic epistem ic logics is extended by the methods of lower and upper approximation of formula evaluating. This allows defining ‘approximation Kripke models’. The results of conceptualization of knowledge on real premises of epistemic argum entation presented in this paper can be applied to rhetoric in real systems of interaction. (shrink)