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.#R##N##R##N#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.#R##N##R##N#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.#R##N##R##N#The authors intend this work to unify the various existing approaches to argument-based defeasible reasoning.
['Guillermo Ricardo Simari', 'R. P. Loui']
A mathematical treatment of defeasible reasoning and its implementation