Abstract
Conflict resolution is an important issue. Dung's preferred semantics is a promising approach to resolving conflicts. However, such semantics is not capable of dealing with conflicts satisfactorily in the argumentation frameworks wherein there exists only empty admissible set. To enhance Dung's preferred semantics, we propose a novel semantics which follows the philosophy of Dung's preferred semantics, while satisfactorily resolving conflicts among arguments. In order to define our semantics, we first redefine Dung's basic notion acceptability by using pairs of sets of arguments and then propose the admissible semantics based on such notion. Relationships with Dung's preferred semantics, ideal semantics and semi-stable semantics are analyzed, and comparisons with other approaches such as CF2 semantics are also discussed.
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.
