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)

The main object of this paper is to provide the logical machinery needed for a viable basis for talking of the ‘consequences’, the ‘content’, or of ‘equivalences’ between inconsistent sets of premisses.With reference to its maximal consistent subsets (m.c.s.), two kinds of ‘consequences’ of a propositional set S are defined. A proposition P is a weak consequence (W-consequence) of S if it is a logical consequence of at least one m.c.s. of S, and P is an inevitable consequence (I-consequence) of (...) S if it is a logical consequence of all the m.c.s. of S. The set of W-consequences of a set S it determines (up to logical equivalence) its m.c.s. (This enables us to define a normal form for every set such that any two sets having the same W-consequences have the same normal form.) The W-consequences and I-consequences will not do to define the ‘content’ of a set S. The first is too broad, may include propositions mutually inconsistent, the second is too narrow. A via media between these concepts is accordingly defined: P is a P-consequence of S, where P is some preference criterion yielding some of the m.c.s. of S as preferred to others, and P is a consequence of all of the P-preferred m.c.s. of S. The bulk of the paper is devoted to discussion of various preference criteria, and also surveys the application of this machinery in diverse contexts - for example, in connection with the processing of mutually inconsistent reports. (shrink)

inheritance reasoning in semantic networks allowing for multiple inheritance with exceptions. The approach leads to a definition of iaheritance that is..