Formalizing defeasible argumentation using a labeled deductive system
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
MetadataShow full item record
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, 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 LDS for defensible 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 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.
Is part ofJournal of Computer Science and Technology, 2001, vol. 1, núm. 4, p. 18-33
European research projects
Showing items related by title, author, creator and subject.
A logic programming framework for possibilistic argumentation: formalization and logical properties Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Simari, Guillermo Ricardo (Elsevier, 2008)In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for ...
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Sandri, Sandra; Simari, Guillermo Ricardo (Elsevier, 2008)Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the ...
Capobianco, Marcela; Chesñevar, Carlos Iván; Simari, Guillermo Ricardo (Springer Verlag, 2005)One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New perceptions modify this agent’s current ...