Explainable ASP

Dauphin, Jérémie; Satoh, Ken

doi:10.1007/978-3-030-33792-6_47

Reference : Explainable ASP


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/41121

Title :	Explainable ASP
Language :	English
Author, co-author :	Dauphin, Jérémie [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
	Satoh, Ken [> >]
Publication date :	2019
Main document title :	PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019, Proceedings
Pages :	610--617
Peer reviewed :	Yes
Event name :	Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019
Event date :	October 28-31, 2019
Keywords :	[en] Explainable AI ; Answer Set Programming
Abstract :	[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.
Permalink :	http://hdl.handle.net/10993/41121
DOI :	10.1007/978-3-030-33792-6_47
Other URL :	https://doi.org/10.1007/978-3-030-33792-6_47

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	ASPexp_final.pdf		Author preprint	218.61 kB	View/Open

All documents in ORBi^lu are protected by a user license.

University of Luxembourg Library | Feedback | Legal notices