Computing Preferences in Abstract Argumentation

Quratul-ain Mahesar, Nir Oren, Wamberto W. Vasconcelos

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We present an extension-based approach for computing preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from an argumentation framework, there is a lack of justification behind their acceptability based on implicit argument preferences. This paper presents a novel algorithm for exhaustively computing and enumerating all possible sets of preferences for a conflict-free set of arguments in an abstract argumentation framework. We prove the soundness and completeness of the algorithm. The research establishes that preferences are determined using an extension-based approach after the evaluation phase (acceptability of arguments) rather than stated beforehand. We also present some novel insights by comparing the computed preferences for the extensions.
Original languageEnglish
Title of host publicationPRIMA 2018: Principles and Practice of Multi-Agent Systems
EditorsTim Miller, Nir Oren, Yuko Sakurai, Itsuki Noda, Bastin Tony Roy Savarimuthu, Tran Cao Son
Place of PublicationCham
PublisherSpringer International Publishing
Number of pages16
ISBN (Electronic)978-3-030-03098-8
ISBN (Print)978-3-030-03098-8
Publication statusPublished - 24 Oct 2018
EventThe 21st International Conference on Principles and Practice of Multi-Agent Systems - AIST Tokyo Waterfront, Tokyo, Japan
Duration: 29 Oct 20182 Nov 2018

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceThe 21st International Conference on Principles and Practice of Multi-Agent Systems
Abbreviated titlePRIMA 2018
Internet address


Dive into the research topics of 'Computing Preferences in Abstract Argumentation'. Together they form a unique fingerprint.

Cite this