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)

An abstract framework for structured arguments is presented, which instantiates Dung's ('On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n- Person Games', Artificial Intelligence , 77, 321-357) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such attacks, preferences may (...) be used, which leads to three corresponding kinds of defeat: undermining, rebutting and undercutting defeats. The nature of the inference rules, the structure of the logical language on which they operate and the origin of the preferences are, apart from some basic assumptions, left unspecified. The resulting framework integrates work of Pollock, Vreeswijk and others on the structure of arguments and the nature of defeat and extends it in several respects. Various rationality postulates are proved to be satisfied by the framework, and several existing approaches are proved to be a special case of the framework, including assumption-based argumentation and DefLog. (shrink)

Marie-Catherine de Marneffe, Anna N. Rafferty and Christopher D. Manning Linguistics Department Computer Science Department Stanford University Stanford University Stanford, CA 94305 Stanford, CA 94305 {rafferty,manning}@stanford.edu [email protected]..

Semantic underspecification is an essential and pervasive property of natural language. This monograph provides a comprehensive survey of the various phenomena in the field of ambiguity and vagueness. The book discusses the major theories of semantic indefiniteness, which have been proposed in linguistics, philosophy and computer science. It argues for a view of indefiniteness as the potential for further contextual specification, and proposes a unified logical treatment of indefiniteness on this basis. The inherent inconsistency of natural language induced by irreducible (...) imprecision is investigated, and treated in terms of a dynamic extension of the proposed logic. The book is an extended edition of a German monograph and is addressed to advanced students and researchers in theoretical and computational linguistics, logic, philosophy of language, and NL- oriented AI. Although it makes extensive use of logical formalisms, it requires only some basic familiarity with standard predicate logic concepts since all technical terms are carefully explained. (shrink)

Argumentation is a very fertile area of research in Artificial Intelligence, and various semantics have been developed to predict when an argument can be accepted, depending on the abstract structure of its defeaters and defenders. When these semantics make conflicting predictions, theoretical arbitration typically relies on ad hoc examples and normative intuition about what prediction ought to be the correct one. We advocate a complementary, descriptive-experimental method, based on the collection of behavioral data about the way human reasoners handle these (...) critical cases. We report two studies applying this method to the case of reinstatement (both in its simple and floating forms). Results speak for the cognitive plausibility of reinstatement and yet show that it does not yield the full expected recovery of the attacked argument. Furthermore, results show that floating reinstatement yields comparable effects to that of simple reinstatement, thus arguing in favor of preferred argumentation semantics, rather than grounded argumentation semantics. Besides their theoretical value for validating and inspiring argumentation semantics, these results have applied value for developing artificial agents meant to argue with human users. (shrink)