Abstract
Understanding the expressiveness of a formalism is undoubtedly an important part of understanding its possibilities and limitations. Translations between different formalisms have proven to be valuable tools for understanding this very expressiveness. In this work we complement recent investigations of the intertranslatability of argumen- tation semantics for Dung's abstract argumentation frameworks. As our focus is on the expressiveness of argumentation semantics we expand the area of interest beyond efficiently computable translations and also consider translations that might not (always) be efficiently computable. This allows us to provide translations between certain semantics, where under established complexity assumptions no efficiently computable translation exists. However, for some semantics we give strong translational impossibility results stating that even with arbitrary computational power we can not in all situations translate one to the other. Finally, this allows us to draw a hierarchy for the expressiveness of argumentation semantics.
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.
