Reference : Explainable ASP
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/41121
Explainable ASP
English
Dauphin, Jérémie mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
Satoh, Ken [> >]
2019
PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019, Proceedings
610--617
Yes
Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019
October 28-31, 2019
[en] Explainable AI ; Answer Set Programming
[en] Despite its proven relevance, ASP (answer set programming) suffers from a lack of transparency in its outputs. Much like other popular artificial intelligence systems such as deep learning, the results do not come with any explanation to support their derivation. In this paper, we use a given answer set as guidance for a simplified top-down procedure of answer set semantics developed by Satoh and Iwayama to provide not only an explanation for the derivation (or non-derivation) of the atoms, but also an explanation for the consistency of the whole answer set itself. Additionally, we show that a full use of the Satoh-Iwayama procedure gives an explanation of why an atom is not present in any answer set.
http://hdl.handle.net/10993/41121
10.1007/978-3-030-33792-6_47
https://doi.org/10.1007/978-3-030-33792-6_47

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
ASPexp_final.pdfAuthor preprint218.61 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.