On the Computation of Warranted Arguments within a Possibilistic Logic Framework with Fuzzy Unification

Possibilistic Defeasible Logic Programming (\Pdelp) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. The aim of this paper is twofold: first to present an approach towards extending \Pdelp in order to incorporate fuzzy constants and fuzzy unification, and after to propose a way to handle conflicting arguments in the context of the extended framework.