Abstract

 
 
 Argumentation Theory provides tools for both modelling and reasoning with controversial information and is a methodology that is often used as a way to give explanations to results provided using machine learning techniques. In this context, labelling-based semantics for Abstract Argumentation Frameworks (AFs) allow for establishing the acceptability of sets of arguments, dividing them into three partitions: acceptable, rejected and undecidable (instead of classical Dung two sets IN and OUT partitions). This kind of semantics have been studied only for classical AFs, whilst the more powerful weighted and preference-based framework has been not studied yet. In this paper, we define a novel labelling semantics for Weighted Argumentation Frameworks, extending and generalising the crisp one.
 
 
Sign-in/Register to access full text options 
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.
