Backing and Undercutting in Defeasible Logic Programming

ANDREA COHEN; ALEJANDRO J. GARCÍA; GUILLERMO R. SIMARI

Conferencia; European Conference on Quantitative and Symbolic Approaches to Reasoning with Uncertainty; 2011

 Two important notions within the field of classical argumentation areundercutting defeaters and backings. The former represent an attack to an infer-ence step, and the latter intend to provide defense against this type of attack.Defeasible Logic Programming (D E LP) is a concrete argumentation system thatallows to identify arguments whose conclusions or intermediate conclusions areincontradiction, capturing thenotionof rebuttingdefeater. Nevertheless, inD E LPis not possible to represent neither undercutting defeaters nor backings. The aimof this work is to extend the formalism of D E LP to allow attack and supportfor defeasible rules. Thus, it will be possible to build arguments for representingundercutting defeaters and backings.