TY - GEN
T1 - Conditional labelling for abstract argumentation
AU - Boella, Guido
AU - Gabbay, Dov M.
AU - Perotti, Alan
AU - Van Der Torre, Leendert
AU - Villata, Serena
PY - 2012
Y1 - 2012
N2 - Agents engage in dialogues having as goals to make some arguments acceptable or unacceptable. To do so they may put forward arguments, adding them to the argumentation framework. Argumentation semantics can relate a change in the framework to the resulting extensions but it is not clear, given an argumentation framework and a desired acceptance state for a given set of arguments, which further arguments should be added in order to achieve those justification statuses. Our methodology, called conditional labelling, is based on argument labelling and assigns to each argument three propositional formulae. These formulae describe which arguments should be attacked by the agent in order to get a particular argument in, out, or undecided, respectively. Given a conditional labelling, the agents have a full knowledge about the consequences of the attacks they may raise on the acceptability of each argument without having to recompute the overall labelling of the framework for each possible set of attack they may raise.
AB - Agents engage in dialogues having as goals to make some arguments acceptable or unacceptable. To do so they may put forward arguments, adding them to the argumentation framework. Argumentation semantics can relate a change in the framework to the resulting extensions but it is not clear, given an argumentation framework and a desired acceptance state for a given set of arguments, which further arguments should be added in order to achieve those justification statuses. Our methodology, called conditional labelling, is based on argument labelling and assigns to each argument three propositional formulae. These formulae describe which arguments should be attacked by the agent in order to get a particular argument in, out, or undecided, respectively. Given a conditional labelling, the agents have a full knowledge about the consequences of the attacks they may raise on the acceptability of each argument without having to recompute the overall labelling of the framework for each possible set of attack they may raise.
UR - http://www.scopus.com/inward/record.url?scp=84859590078&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-29184-5_15
DO - 10.1007/978-3-642-29184-5_15
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84859590078
SN - 9783642291838
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 232
EP - 248
BT - Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers
T2 - 1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011
Y2 - 16 July 2011 through 17 July 2011
ER -