Abstract
This paper studies representation of argumentation frameworks (AFs) in answer set programming (ASP). Four different transformations from AFs to logic programs are provided under the complete semantics, stable semantics, grounded semantics and preferred semantics. The proposed transformations encode labelling-based argumentation semantics at the object level, and different semantics of AFs are uniformly characterized by stable models of transformed programs. We show how transformed programs can be used for solving AF problems such as query-answering, enforcement of arguments, and agreement of different AFs. The results exploit new connection between AF and logic programming, and enables one to realize AF on top of existing answer set solvers.
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.
