On Learning Abstract Argumentation Graphs from Bivalent Statement Labellings

摘要

In this paper, we investigate the problem of finding argumentation graphs consistent with some observed statement labellings. We consider a general abstract framework, where the structure of arguments is left unspecified, and we focus on particular grounded argument labellings where arguments can be omitted. The specification of such grounded labellings, the Principle of Multiple Explanations and the Principle of Parsimony lead us to a simple and efficient anytime algorithm to induce 'on the fly' all the 'argument-parsimonious' argumentation graphs consistent with an input stream of statement labellings.