Experiments and Applications
The aim of this workpackage is to produce a large dataset of problem instances, to integrate the different developments of the four other workpackages into a prototype application, in the aim to finally obtain and analyze experimental results related to these WPs. An expected output of this workpackage is also to come up with reasoning modules which can be integrated in existing platforms.
Indeed an important application with great potential impact is related to debate systems that are emerging on the we; see for instance Debatebase and DebateGraph. The success of these platforms in their currrent form seems to suggest that they can become an important source of information, just as wikipedia is now. For instance, DebateGraph was used to produce maps for the British newspaper “The Independent” and talk shows on CNN, and is supported by the White House, the European Commission, and other institutions. These debate systems are still in their infancy though. For the moment they are mainly interfaces where people can give arguments pro or con a given issue without any particular processing and evaluation of those arguments. The AMANDE project will provide automatic reasoning/decision capabilities to these platforms.
CoQuiAAS is a tool developped as a part of the AMANDE project to perform the most usual inference task on abstract argumentation frameworks (computing one or all the extensions, deciding if an argument is credulously or skeptically accepted) for the classical Dung semantics (complete, preferred, stable and grounded). CoQuiAAS has been conceived with a view to be easy to use and to provide a base to develop some other features in the future (other semantics, labellings, extensions of Dung's framework,...).
SESAME is another tool developped as a part of the AMANDE project, to specify argumentation semantics for abstract argumentation frameworks, and to tackle the verification problem (is a given set of arguments an extension under a semantics for a given argumentation framework?). The semantics which can be specified go well beyond the range of semantics already known, and the user can indeed specify brand new semantics of her own. The system then provides a logical encoding in the form of a parametrized formula. When applied to a given subset of arguments of a given argumentation framework, the instantiated formula is satisfiable if and only if the set is an extension for the framework according to the specified semantics. Satisfiability can be checked by feeding the instantiated formula to a SAT solver.