Conference Paper/Proceeding/Abstract 935 views
On Computing Explanations in Argumentation
Xiuyi Fan,
Francesca Toni
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Pages: 1496 - 1502
Swansea University Author: Xiuyi Fan
Abstract
On Computing Explanations in Argumentation
Published in: | Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence |
---|---|
ISBN: | 978-1-57735-698-1 |
Published: |
Austin, Texas, USA
Twenty-Ninth AAAI Conference on Artificial Intelligence
2015
|
Online Access: |
https://dl.acm.org/doi/10.5555/2886521.2886528 |
URI: | https://cronfa.swan.ac.uk/Record/cronfa39401 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2018-04-13T19:29:17Z |
---|---|
last_indexed |
2020-07-23T18:59:09Z |
id |
cronfa39401 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2020-07-23T14:29:05.1546106</datestamp><bib-version>v2</bib-version><id>39401</id><entry>2018-04-13</entry><title>On Computing Explanations in Argumentation</title><swanseaauthors><author><sid>a88a07c43b3e80f27cb96897d1bc2534</sid><firstname>Xiuyi</firstname><surname>Fan</surname><name>Xiuyi Fan</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2018-04-13</date><abstract/><type>Conference Paper/Proceeding/Abstract</type><journal>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</journal><paginationStart>1496</paginationStart><paginationEnd>1502</paginationEnd><publisher>Twenty-Ninth AAAI Conference on Artificial Intelligence</publisher><placeOfPublication>Austin, Texas, USA</placeOfPublication><isbnPrint>978-1-57735-698-1</isbnPrint><keywords/><publishedDay>25</publishedDay><publishedMonth>1</publishedMonth><publishedYear>2015</publishedYear><publishedDate>2015-01-25</publishedDate><doi/><url>https://dl.acm.org/doi/10.5555/2886521.2886528</url><notes>*Originality:*In this work, we propose a new argumentation semantics, related admissibility, designed for giving explanations to arguments in both Abstract Argumentation and Assumption-based Argumentation. For both frameworks, we give a correct computational counterpart for explanations using dispute forests.*Significance:*One of the most prominent promises of using argumentation as a modelling tool lies in its ability of explaining the process and results of computation. Yet, until this paper, there was no attempt on formally treating explanation as a computational concept - argumentation semantics. Such interpretation is important as it enables the use of computation technique towards understanding an intrinsically philosophical concept. The presented model formulates philosophical questions into computational ones, which can be solved with well-developed techniques.*Rigor:*All results are shown with full proofs. This paper is published in the AAAI conference, a top conference in artificial intelligence.</notes><college>COLLEGE NANME</college><CollegeCode>COLLEGE CODE</CollegeCode><institution>Swansea University</institution><apcterm/><lastEdited>2020-07-23T14:29:05.1546106</lastEdited><Created>2018-04-13T15:36:41.8628824</Created><authors><author><firstname>Xiuyi</firstname><surname>Fan</surname><order>1</order></author><author><firstname>Francesca</firstname><surname>Toni</surname><order>2</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2020-07-23T14:29:05.1546106 v2 39401 2018-04-13 On Computing Explanations in Argumentation a88a07c43b3e80f27cb96897d1bc2534 Xiuyi Fan Xiuyi Fan true false 2018-04-13 Conference Paper/Proceeding/Abstract Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence 1496 1502 Twenty-Ninth AAAI Conference on Artificial Intelligence Austin, Texas, USA 978-1-57735-698-1 25 1 2015 2015-01-25 https://dl.acm.org/doi/10.5555/2886521.2886528 *Originality:*In this work, we propose a new argumentation semantics, related admissibility, designed for giving explanations to arguments in both Abstract Argumentation and Assumption-based Argumentation. For both frameworks, we give a correct computational counterpart for explanations using dispute forests.*Significance:*One of the most prominent promises of using argumentation as a modelling tool lies in its ability of explaining the process and results of computation. Yet, until this paper, there was no attempt on formally treating explanation as a computational concept - argumentation semantics. Such interpretation is important as it enables the use of computation technique towards understanding an intrinsically philosophical concept. The presented model formulates philosophical questions into computational ones, which can be solved with well-developed techniques.*Rigor:*All results are shown with full proofs. This paper is published in the AAAI conference, a top conference in artificial intelligence. COLLEGE NANME COLLEGE CODE Swansea University 2020-07-23T14:29:05.1546106 2018-04-13T15:36:41.8628824 Xiuyi Fan 1 Francesca Toni 2 |
title |
On Computing Explanations in Argumentation |
spellingShingle |
On Computing Explanations in Argumentation Xiuyi Fan |
title_short |
On Computing Explanations in Argumentation |
title_full |
On Computing Explanations in Argumentation |
title_fullStr |
On Computing Explanations in Argumentation |
title_full_unstemmed |
On Computing Explanations in Argumentation |
title_sort |
On Computing Explanations in Argumentation |
author_id_str_mv |
a88a07c43b3e80f27cb96897d1bc2534 |
author_id_fullname_str_mv |
a88a07c43b3e80f27cb96897d1bc2534_***_Xiuyi Fan |
author |
Xiuyi Fan |
author2 |
Xiuyi Fan Francesca Toni |
format |
Conference Paper/Proceeding/Abstract |
container_title |
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence |
container_start_page |
1496 |
publishDate |
2015 |
institution |
Swansea University |
isbn |
978-1-57735-698-1 |
publisher |
Twenty-Ninth AAAI Conference on Artificial Intelligence |
url |
https://dl.acm.org/doi/10.5555/2886521.2886528 |
document_store_str |
0 |
active_str |
0 |
published_date |
2015-01-25T03:50:02Z |
_version_ |
1763752440141709312 |
score |
11.037166 |