Formalizing Defeasible Argumentation Using a Labeled Deductive System

CARLOS IVÁN CHESÑEVAR; GUILLERMO SIMARI,

Journal Of Computer Science And Technology

Lugar: Argentina; Año: 2001 vol. 1 p. 18 - 33

1666-6038

In the last years there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI, logic programming and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to formalize such a kind of complex logical systems. In the last decade, emph{defeasible argumentation} has proven to be a confluence point for many approaches to formalizing commonsense reasoning. Different formalisms have been developed, many of them sharing common features. This paper presents a formalization of an emph{LDS for defeasible argumentation}, in which the main issues concerning defeasible argumentation are captured within a unified logical framework. The proposed framework is defined in two stages. First, defeasible inference will be formalized by characterizing an emph{argumentative LDS}. That system will be then extended in order to capture conflict among arguments using a dialectical approach. We also present some logical properties emerging from the proposed framework, discussing also its semantical characterization.