Computational models of argumentation are approaches that deal with the representation and interaction of arguments and counterarguments. These models can be applied in all areas that benefit from automatic decision-support such as medicine, accounting, chemistry, and law. Many of these models were inspired by works within the fields of non-monotonic reasoning and logic programming and therefore share the sometimes considerable computational complexity of these approaches.

Algorithmic aspects of computational models of argumentation have recently gained attention within the community, in particular due to the International Competition on Computational Models of Argumentation (ICCMA), which ran for the first time in 2015. This workshop aims at complementing the competition by providing a forum to present and discuss both systems and algorithms dealing with all aspects of computational argumentation, in particular those approaches addressing the tracks of the competition.

This workshop welcomes technical contributions in all areas dealing with algorithms and systems of formal argument. Topics of interest include, but are not limited to:

The workshop specifically welcomes preliminary works on the above topics. In particular, no systematic evaluations are needed for inclusion in the program. Finally, we welcome position papers that propose new tracks for the competition or discuss general matters related to it.

We are pleased to announce that there will be an invited talk by Prof. Stefan Woltran: "Advanced Systems for Abstract Argumentation - Trends and Challenges".

SAFA2016 will be hosted as a COMMA 2016 workshop, and will take place in Postdam, Germany, September 13, 2016.

Design by TEMPLATED.