Send to Friend

From	To
Email: * First Name: Last Name: Send a copy to myself	Email: * First Name: Last Name:

Send to Friend from IIIA

Message Text:

A characterization of collective conflict for defeasible argumentation

argumentation

Publication Type:

Conference Paper

Authors:

Teresa Alsinet; Ramon Bejar; Lluís Godo

Source:

Third International Conference on Computational Models of Argument, COMMA 2010, IOS Press, Volume 216, Desenzano del Garda, Italy, p.27-38 (2010)

ISBN:

978-1-60750-618-8

Abstract:

In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) con- flict among arguments. This allows us to ensure direct and indirect consistency (in the sense of Caminada and Amgoud) without distinguishing between direct and in- direct conflicts. Then, the general defeasible argumentation framework is extended by allowing to attach levels of preference to defeasible knowledge items and by providing a level-wise definition of warranted and blocked conclusions. Finally, we formalize the warrant recursive semantics for the particular framework of Pos- sibilistic Defeasible Logic Programming, characterize the unique output program property and design an efficient algorithm for computing warranted conclusions in polynomial space.