This paper offers a dialogue theory of explanation. A successful explanation is defined as a transfer of understanding in a dialogue system in which a questioner and a respondent take part. The questioner asks a special sort of why-question that asks for understanding of something and the respondent provides a reply that transfers understanding to the questioner. The theory is drawn from recent work on explanation in artificial intelligence (AI), especially in expert systems, but applies to scientific, legal and everyday (...) conversational explanations. (shrink)

We present a mathematical approach to defeasible reasoning based on arguments. This approach integrates the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. The main contribution of this paper is a precise, well-defined system which exhibits correct behavior when applied to the benchmark examples in the literature. It aims for usability rather than novelty. We prove that an order relation can be introduced among equivalence classes of arguments under the equi-specificity relation. We also prove (...) a theorem that ensures the termination of the process of finding the justified facts. Two more lemmas define a reduced search space for checking specificity. In order to implement the theoretical ideas, the language is restricted to Horn clauses for the evidential context. The language used to represent defeasible rules has been restricted in a similar way. The authors intend this work to unify the various existing approaches to argument-based defeasible reasoning. (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)

In its present incarnation, OSCAR is a fully implemented programmable architecture for a rational agent. If we just focus upon the epistemic reasoning in OSCAR, we have a powerful general-purpose defeasible reasoner. The purpose of this paper is to describe that reasoner. OSCAR's defeasible reasoner is based upon seven fundamental ideas. These are (1) an argument-based account of defeasible reasoning, (2) an analysis of defeat-status given a set of interrelated arguments, (3) a general adequacy criterion for automated defeasible reasoners, called (...) “d.e.-adequacy”, (4) the claim that a generalpurpose defeasible reasoner must have the kind of structure I have called “flag-based”, (5) an algorithm for computing defeat-status, (6) an interest-driven monotonic reasoner, and (7) an account of degrees of justification, degrees of interest, and their interactions. These will each be discussed in turn. (shrink)

There was a long tradition in philosophy according to which good reasoning had to be deductively valid. However, that tradition began to be questioned in the 1960’s, and is now thoroughly discredited. What caused its downfall was the recognition that many familiar kinds of reasoning are not deductively valid, but clearly confer justification on their conclusions. Here are some simple examples.

Logical models of argument formalize commonsense reasoning while taking process and computation seriously. This survey discusses the main ideas which characterize di erent logical models of argument. It presents the formal features of a few main approaches to the modeling of argumentation. We trace the evolution of argumentationfrom the mid-80's, when argumentsystems emerged as an alternative to nonmonotonic formalisms based on classical logic, to the present, as argument is embedded in di erent complex systems for real-world applications, and allows more (...) formal work to be done in different areas, such as AI & Law, case-based reasoning and negotiation among intelligent agents. (shrink)