Abstract
ABSTRACT This work is related to a computational issue concerning an enriched abstract argumentation framework called RAF (‘Recursive Argumentation Framework’). A RAF is composed of a set of arguments and of a binary relation which models the attacks as in Dung's seminal argumentation framework. The main difference between Dung's framework and a RAF is the fact that a RAF is able to take into account higher-order interactions (i.e. an attack can target an attack and not only an argument). This kind of framework is recent enough for an efficient computation of its main semantics to remain an open question. In this paper, we propose one of the first algorithms dedicated to this issue, RAFDivider. We prove its soundness and its completeness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
