Computati onal models of argumentation are approaches that d eal with the representation and interaction of arg uments and counterarguments. These models can be a pplied in all areas that benefit from automatic de cision-support such as medicine, accounting, chemi stry, and law. Many of these models were inspired by works within the fields of non-monotonic reason ing and logic programming and therefore share the sometimes considerable computational complexity of these approaches.
\nAlgorithmic aspects o f computational models of argumentation are an imp ortant area, as witnessed by the popularity of the International Competition on Computational Models of Argumentation (ICCMA). This workshop aims at c omplementing the competition by providing a forum to present and discuss both systems and algorithms dealing with all aspects of computational argumen tation, in particular those approaches addressing the tracks of the competition.
\nThis workshop welcomes technical contributions in all areas dealing with algorithms and systems of formal argument. The workshop specifically welc omes preliminary works on the above topics. In par ticular, no systematic evaluations are needed for inclusion in the program. Finally, we welcome posi tion papers that propose new tracks for the compet ition or discuss general matters related to it.
\n