Download PDFOpen PDF in browserConflict Resolution in Structured Argumentation12 pages•Published: July 28, 2014AbstractWhile several interesting argumentation-based semantics fordefeasible logic programs have been proposed, to our best knowledge, none of these approaches is able to fully handle the closure under strict rules in a sufficient manner: they are either not closed, or they use workarounds such as transposition of rules which violates the desired directionality of logic programming rules. We propose a novel argumentation-based semantics, in which the status of arguments is determined by attacks between newly introduced conflict resolutions instead of attacks between arguments. We show that the semantics is closed w.r.t. strict rules and respects the directionality of inference rules, as well as other desired properties previously published in the literature. Keyphrases: argumentation, conflict resolution, defeasible logic program In: Ken Mcmillan, Aart Middeldorp, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 26, pages 23-34.
|