Computing Preferences in Abstract Argumentation

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

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

Abstract

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
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems. PRIMA 2018
EditorsTim Miller, Nir Oren, Yuko Sakurai, Itsuki Noda, Bastin Tony Roy Savarimuthu, Tran Cao Son
PublisherSpringer
Pages387-402
Number of pages16
ISBN (Electronic)9783030030988
ISBN (Print)9783030030971
DOIs
Publication statusPublished - Nov 2018
EventPRIMA 2018: The 21st International Conference on Principles and Practice of Multi-Agent Systems - AIST Tokyo Waterfront, Tokyo, Japan
Duration: 31 Oct 20182 Nov 2018

Publication series

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

Conference

ConferencePRIMA 2018: The 21st International Conference on Principles and Practice of Multi-Agent Systems
CountryJapan
CityTokyo
Period31/10/182/11/18

Fingerprint

Semantics

Cite this

Mahesar, Q-A., Oren, N., & Vasconcelos, W. W. (2018). Computing Preferences in Abstract Argumentation. In T. Miller, N. Oren, Y. Sakurai, I. Noda, B. T. R. Savarimuthu, & T. C. Son (Eds.), PRIMA 2018: Principles and Practice of Multi-Agent Systems. PRIMA 2018 (pp. 387-402). (Lecture Notes in Computer Science; Vol. 11224). Springer . https://doi.org/10.1007/978-3-030-03098-8_24

Computing Preferences in Abstract Argumentation. / Mahesar, Quratul-Ain; Oren, Nir; Vasconcelos, Wamberto W.

PRIMA 2018: Principles and Practice of Multi-Agent Systems. PRIMA 2018. ed. / Tim Miller; Nir Oren; Yuko Sakurai; Itsuki Noda; Bastin Tony Roy Savarimuthu; Tran Cao Son. Springer , 2018. p. 387-402 (Lecture Notes in Computer Science; Vol. 11224).

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

Mahesar, Q-A, Oren, N & Vasconcelos, WW 2018, Computing Preferences in Abstract Argumentation. in T Miller, N Oren, Y Sakurai, I Noda, BTR Savarimuthu & TC Son (eds), PRIMA 2018: Principles and Practice of Multi-Agent Systems. PRIMA 2018. Lecture Notes in Computer Science, vol. 11224, Springer , pp. 387-402, PRIMA 2018: The 21st International Conference on Principles and Practice of Multi-Agent Systems, Tokyo, Japan, 31/10/18. https://doi.org/10.1007/978-3-030-03098-8_24
Mahesar Q-A, Oren N, Vasconcelos WW. Computing Preferences in Abstract Argumentation. In Miller T, Oren N, Sakurai Y, Noda I, Savarimuthu BTR, Son TC, editors, PRIMA 2018: Principles and Practice of Multi-Agent Systems. PRIMA 2018. Springer . 2018. p. 387-402. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-03098-8_24
Mahesar, Quratul-Ain ; Oren, Nir ; Vasconcelos, Wamberto W. / Computing Preferences in Abstract Argumentation. PRIMA 2018: Principles and Practice of Multi-Agent Systems. PRIMA 2018. editor / Tim Miller ; Nir Oren ; Yuko Sakurai ; Itsuki Noda ; Bastin Tony Roy Savarimuthu ; Tran Cao Son. Springer , 2018. pp. 387-402 (Lecture Notes in Computer Science).
@inproceedings{012548740cdd4996b573811ea3c41187,
title = "Computing Preferences in Abstract Argumentation",
abstract = "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.",
author = "Quratul-Ain Mahesar and Nir Oren and Vasconcelos, {Wamberto W.}",
note = "Financial support from The UK Engineering and Physical Sciences Research Council (EPSRC) for the grant (EP/P011829/1), Supporting Security Policy with Effective Digital Intervention (SSPEDI) is gratefully acknowledged.",
year = "2018",
month = "11",
doi = "10.1007/978-3-030-03098-8_24",
language = "English",
isbn = "9783030030971",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "387--402",
editor = "Tim Miller and Nir Oren and Yuko Sakurai and Itsuki Noda and Savarimuthu, {Bastin Tony Roy} and Son, {Tran Cao}",
booktitle = "PRIMA 2018",

}

TY - GEN

T1 - Computing Preferences in Abstract Argumentation

AU - Mahesar, Quratul-Ain

AU - Oren, Nir

AU - Vasconcelos, Wamberto W.

N1 - Financial support from The UK Engineering and Physical Sciences Research Council (EPSRC) for the grant (EP/P011829/1), Supporting Security Policy with Effective Digital Intervention (SSPEDI) is gratefully acknowledged.

PY - 2018/11

Y1 - 2018/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85056461530&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03098-8_24

DO - 10.1007/978-3-030-03098-8_24

M3 - Conference contribution

SN - 9783030030971

T3 - Lecture Notes in Computer Science

SP - 387

EP - 402

BT - PRIMA 2018

A2 - Miller, Tim

A2 - Oren, Nir

A2 - Sakurai, Yuko

A2 - Noda, Itsuki

A2 - Savarimuthu, Bastin Tony Roy

A2 - Son, Tran Cao

PB - Springer

ER -