Answering the “why” in answer set programming – A survey of explanation approaches

Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory and practice of logic programming Jg. 19; H. 2; S. 114 - 203
Hauptverfasser: FANDINNO, JORGE, SCHULZ, CLAUDIA
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cambridge, UK Cambridge University Press 01.03.2019
Cambridge University Press (CUP)
Schlagworte:
ISSN:1471-0684, 1475-3081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanation” for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is answer set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question of why an answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals is not an answer set or why no solution exists at all.
AbstractList Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanation” for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is answer set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question of why an answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals is not an answer set or why no solution exists at all.
Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanation” for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is answer set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question of why an answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals is not an answer set or why no solution exists at all.
Author SCHULZ, CLAUDIA
FANDINNO, JORGE
Author_xml – sequence: 1
  givenname: JORGE
  orcidid: 0000-0002-3917-8717
  surname: FANDINNO
  fullname: FANDINNO, JORGE
  email: jorge.fandinno@irit.fr
  organization: Institut de Recherche en Informatique de Toulouse (IRIT), Université de Toulouse, CNRS, Toulouse, France (e-mail: jorge.fandinno@irit.fr)
– sequence: 2
  givenname: CLAUDIA
  surname: SCHULZ
  fullname: SCHULZ, CLAUDIA
  email: schulz@ukp.informatik.tu-darmstadt.de
  organization: Ubiquitous Knowledge Processing (UKP) Lab, Technische Universität Darmstadt, Darmstadt, Germany (e-mail: schulz@ukp.informatik.tu-darmstadt.de)
BackLink https://hal.science/hal-03032897$$DView record in HAL
BookMark eNp9kM9Kw0AQhxdRsK0-gLcFTx6iO_svybEUtULBgwrewibdNClpEnfT1t76Dl715fokbtqioOhpl5nvG2Z-XXRYVqVG6AzIJRDwrx6A-0BkwCEghAjGD1DHlYTHSACH2z94bf8Yda2dEgKSUd5Bz_3SLrXJywluMo036_dlttqsP3BeYrVtYasbXJtqYtRs1nKb9RvuYzs3C73CVYr1a12oUjV55ZTakSrJtD1BR6kqrD7dvz30dHP9OBh6o_vbu0F_5CVcksYTNJA-G8da-YSkApJQcxaPqQipjEN3SixSBRBzzqSWaUoZBDQMEx5LxmQYsx662M3NVBHVJp8ps4oqlUfD_ihqa4QRRoPQX4Bjz3esW_Jlrm0TTau5Kd16EXW5hQIEFY6CHZWYylqj06-xQKI27OhX2M7xfzhJ3mwjaYzKi39NtjfVLDb5eKK_l_rb-gSxVZR8
CitedBy_id crossref_primary_10_1017_S1471068418000510
crossref_primary_10_1017_S147106842300011X
crossref_primary_10_1007_s10994_023_06358_1
crossref_primary_10_1017_S1471068420000320
crossref_primary_10_1111_cbdd_14262
crossref_primary_10_1007_s10489_022_03669_z
crossref_primary_10_4204_EPTCS_416_31
crossref_primary_10_1017_S1471068425100124
crossref_primary_10_1016_j_artint_2021_103563
crossref_primary_10_1145_3568955
crossref_primary_10_1007_s42979_021_00573_0
crossref_primary_10_1017_S1471068424000048
crossref_primary_10_1016_j_ijar_2023_01_004
crossref_primary_10_1016_j_datak_2025_102494
crossref_primary_10_1109_TNSE_2020_3047580
crossref_primary_10_1017_S1471068422000084
Cites_doi 10.1016/S1574-6526(07)03007-6
10.1017/S1471068410000554
10.1017/S1471068413000598
10.1007/11799573_16
10.1017/S1471068405002589
10.1007/978-1-4684-3384-5_11
10.1016/S0304-3975(96)80707-9
10.1017/S1471068413000653
10.1016/j.artint.2004.04.004
10.7551/mitpress/1752.003.0010
10.1145/351268.351290
10.1016/S0020-0190(02)00290-9
10.1017/S147106841100007X
10.1145/73721.73722
10.1017/S1471068410000530
10.1145/2043174.2043195
10.1016/0004-3702(86)90080-9
10.1007/3-540-45402-0_38
10.1016/j.artint.2010.04.002
10.1017/S1471068414000234
10.1017/S1471068417000217
10.1017/S1471068416000569
10.1145/321978.321991
10.3233/FI-2016-1399
10.1145/116825.116838
10.1007/978-3-642-20895-9_37
10.1007/978-3-319-23264-5_5
10.1017/S1471068410000256
10.1007/BF03037169
10.1007/s11098-006-9057-9
10.1007/3-540-57530-8_7
10.1007/978-3-642-40564-8_6
10.2307/2025310
10.5840/jphil20091061128
10.1017/S1471068414000702
10.1017/S1471068416000107
10.1609/aimag.v38i3.2741
10.1007/BF03037396
10.1007/978-3-540-72200-7_5
10.1007/BF00283131
10.1007/978-3-642-40564-8_45
10.1007/978-3-642-40564-8_32
10.1007/978-3-642-40564-8_53
10.1017/S1471068410000384
10.1017/S1471068408003633
10.1007/978-3-319-23264-5_22
10.1016/S0022-0000(05)80053-4
10.7551/mitpress/1192.001.0001
10.1016/0743-1066(93)90032-C
10.1017/S1471068417000345
10.1007/BFb0019400
10.1007/978-3-642-20895-9_13
10.1007/978-3-642-20832-4_21
10.1007/978-3-319-23264-5_39
10.1017/S1471068405002528
10.7551/mitpress/4307.003.0031
10.1111/j.1467-8640.1986.tb00079.x
10.1017/S1471068413000410
10.1007/978-3-642-15025-8_24
10.1007/978-3-642-20895-9_45
10.1145/308386.308444
10.1007/978-3-319-23264-5_24
10.1007/978-0-387-98197-0_10
10.1017/S1471068416000454
10.1017/S1471068415000356
10.1007/978-3-319-11558-0_21
10.1017/S1471068416000466
10.1145/1149114.1149117
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2019
licence_http://creativecommons.org/publicdomain/zero
Copyright_xml – notice: Copyright © Cambridge University Press 2019
– notice: licence_http://creativecommons.org/publicdomain/zero
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
1XC
VOOES
DOI 10.1017/S1471068418000534
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList
Computer Science Database

CrossRef
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate Answering the “why” in ASP
J. Fandinno and C. Schulz
EISSN 1475-3081
EndPage 203
ExternalDocumentID oai:HAL:hal-03032897v1
10_1017_S1471068418000534
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
IPYYG
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
1XC
VOOES
ID FETCH-LOGICAL-c460t-528673dbea700f51c9e43bd25926b9000b5fa11b4436e6ff2318299c4b63369b3
IEDL.DBID K7-
ISICitedReferencesCount 33
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000458807300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Sat Nov 22 06:20:34 EST 2025
Fri Jul 25 10:36:27 EDT 2025
Tue Nov 18 22:33:35 EST 2025
Sat Nov 29 04:58:36 EST 2025
Tue Jan 21 06:21:57 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords answer set
debugging
justification
explanation
Justification
Answer set
Explanation
Debugging
Language English
License https://www.cambridge.org/core/terms
licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c460t-528673dbea700f51c9e43bd25926b9000b5fa11b4436e6ff2318299c4b63369b3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3917-8717
OpenAccessLink https://hal.science/hal-03032897
PQID 2180951525
PQPubID 43613
PageCount 90
ParticipantIDs hal_primary_oai_HAL_hal_03032897v1
proquest_journals_2180951525
crossref_primary_10_1017_S1471068418000534
crossref_citationtrail_10_1017_S1471068418000534
cambridge_journals_10_1017_S1471068418000534
PublicationCentury 2000
PublicationDate 2019-03-01
PublicationDateYYYYMMDD 2019-03-01
PublicationDate_xml – month: 03
  year: 2019
  text: 2019-03-01
  day: 01
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2019
Publisher Cambridge University Press
Cambridge University Press (CUP)
Publisher_xml – name: Cambridge University Press
– name: Cambridge University Press (CUP)
References Schulz (S1471068418000534_ref97) 2013; 13
S1471068418000534_ref87
Halpern (S1471068418000534_ref57) 2008
S1471068418000534_ref88
S1471068418000534_ref85
S1471068418000534_ref86
S1471068418000534_ref101
S1471068418000534_ref89
Bratko (S1471068418000534_ref12) 2001
S1471068418000534_ref80
Albrecht (S1471068418000534_ref1) 2013; 8439
cr-split#-S1471068418000534_ref81.1
cr-split#-S1471068418000534_ref81.2
S1471068418000534_ref76
S1471068418000534_ref77
S1471068418000534_ref75
S1471068418000534_ref110
S1471068418000534_ref112
S1471068418000534_ref78
S1471068418000534_ref111
S1471068418000534_ref79
S1471068418000534_ref103
S1471068418000534_ref72
S1471068418000534_ref107
S1471068418000534_ref106
S1471068418000534_ref70
S1471068418000534_ref108
S1471068418000534_ref71
Pereira (S1471068418000534_ref84) 1991; 808
Cabalar (S1471068418000534_ref20) 2014; 8761
S1471068418000534_ref29
Green (S1471068418000534_ref54) 2007
S1471068418000534_ref28
S1471068418000534_ref21
S1471068418000534_ref22
S1471068418000534_ref25
S1471068418000534_ref23
S1471068418000534_ref24
Gebser (S1471068418000534_ref48) 2008
S1471068418000534_ref114
S1471068418000534_ref113
S1471068418000534_ref2
S1471068418000534_ref18
S1471068418000534_ref19
S1471068418000534_ref16
Specht (S1471068418000534_ref102) 1993
S1471068418000534_ref17
El-Khatib (S1471068418000534_ref38) 2005
S1471068418000534_ref98
S1471068418000534_ref10
S1471068418000534_ref3
Ulbricht (S1471068418000534_ref109) 2016; 10021
Béatrix (S1471068418000534_ref6) 2016; 6
S1471068418000534_ref4
S1471068418000534_ref99
S1471068418000534_ref11
S1471068418000534_ref5
S1471068418000534_ref96
S1471068418000534_ref7
S1471068418000534_ref14
S1471068418000534_ref15
S1471068418000534_ref9
S1471068418000534_ref13
S1471068418000534_ref90
Shapiro (S1471068418000534_ref100) 1983
S1471068418000534_ref91
S1471068418000534_ref94
S1471068418000534_ref95
S1471068418000534_ref92
S1471068418000534_ref93
Ferrand (S1471068418000534_ref45) 2006; 25
S1471068418000534_ref49
Costantini (S1471068418000534_ref26) 2010
S1471068418000534_ref43
S1471068418000534_ref44
S1471068418000534_ref41
S1471068418000534_ref42
S1471068418000534_ref47
S1471068418000534_ref46
Brain (S1471068418000534_ref8) 2005
S1471068418000534_ref40
Hall (S1471068418000534_ref55) 2004
Sterling (S1471068418000534_ref104) 1994
S1471068418000534_ref39
S1471068418000534_ref32
S1471068418000534_ref30
Pereira (S1471068418000534_ref83) 1992
S1471068418000534_ref31
S1471068418000534_ref36
S1471068418000534_ref37
S1471068418000534_ref34
S1471068418000534_ref35
McCarthy (S1471068418000534_ref74) 1977
S1471068418000534_ref65
S1471068418000534_ref66
Sterling (S1471068418000534_ref105) 1989; 1
S1471068418000534_ref63
S1471068418000534_ref64
S1471068418000534_ref69
S1471068418000534_ref68
S1471068418000534_ref61
S1471068418000534_ref62
S1471068418000534_ref60
Pemmasani (S1471068418000534_ref82) 2003; 2998
Maudlin (S1471068418000534_ref73) 2004
Lifschitz (S1471068418000534_ref67) 2010; 6300
Costantini (S1471068418000534_ref27) 2011
S1471068418000534_ref52
S1471068418000534_ref53
S1471068418000534_ref58
S1471068418000534_ref59
S1471068418000534_ref56
Denecker (S1471068418000534_ref33) 1993
S1471068418000534_ref50
S1471068418000534_ref51
References_xml – ident: S1471068418000534_ref87
– ident: S1471068418000534_ref50
  doi: 10.1016/S1574-6526(07)03007-6
– ident: S1471068418000534_ref49
  doi: 10.1017/S1471068410000554
– ident: S1471068418000534_ref29
– ident: S1471068418000534_ref39
  doi: 10.1017/S1471068413000598
– ident: S1471068418000534_ref89
  doi: 10.1007/11799573_16
– ident: S1471068418000534_ref24
  doi: 10.1017/S1471068405002589
– ident: S1471068418000534_ref22
  doi: 10.1007/978-1-4684-3384-5_11
– ident: S1471068418000534_ref35
  doi: 10.1016/S0304-3975(96)80707-9
– ident: S1471068418000534_ref70
– ident: S1471068418000534_ref59
  doi: 10.1017/S1471068413000653
– ident: S1471068418000534_ref69
  doi: 10.1016/j.artint.2004.04.004
– ident: S1471068418000534_ref61
– start-page: 225
  volume-title: Causation and Counterfactuals
  year: 2004
  ident: S1471068418000534_ref55
  doi: 10.7551/mitpress/1752.003.0010
– ident: S1471068418000534_ref93
  doi: 10.1145/351268.351290
– ident: S1471068418000534_ref25
  doi: 10.1016/S0020-0190(02)00290-9
– ident: S1471068418000534_ref92
  doi: 10.1017/S147106841100007X
– year: 2005
  ident: S1471068418000534_ref8
  article-title: Debugging logic programs under the answer set semantics
  publication-title: Proceedings of the 3rd Workshop on Answer Set Programming, Advances in Theory and Implementation (ASP’05).
– ident: S1471068418000534_ref23
– ident: S1471068418000534_ref96
– ident: S1471068418000534_ref47
– ident: S1471068418000534_ref75
– ident: S1471068418000534_ref111
  doi: 10.1145/73721.73722
– ident: S1471068418000534_ref7
  doi: 10.1017/S1471068410000530
– ident: S1471068418000534_ref13
  doi: 10.1145/2043174.2043195
– ident: S1471068418000534_ref31
  doi: 10.1016/0004-3702(86)90080-9
– volume-title: Prolog Programming for Artificial Intelligence
  year: 2001
  ident: S1471068418000534_ref12
– volume: 808
  volume-title: Knowledge Representation and Reasoning under Uncertainty. Logic at Work 1992
  year: 1991
  ident: S1471068418000534_ref84
– ident: S1471068418000534_ref66
– ident: S1471068418000534_ref108
  doi: 10.1007/3-540-45402-0_38
– ident: S1471068418000534_ref43
– ident: S1471068418000534_ref40
  doi: 10.1016/j.artint.2010.04.002
– ident: S1471068418000534_ref19
  doi: 10.1017/S1471068414000234
– start-page: 68
  year: 2011
  ident: S1471068418000534_ref27
  article-title: Conflict, consistency and truth-dependencies in graph representations of answer set logic programs
  publication-title: Revised Selected Papers of the 2nd International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR’11)
– start-page: 49
  year: 2005
  ident: S1471068418000534_ref38
  article-title: Justification and debugging of answer set programs in ASP - Prolog
  publication-title: Proceedings of the 6th International Workshop on Automated Debugging (AADEBUG’05)
– volume: 8439
  start-page: 1
  volume-title: Declarative Programming and Knowledge Management. INAP 2013, WLP 2013, WFLP 2013
  year: 2013
  ident: S1471068418000534_ref1
– ident: S1471068418000534_ref80
  doi: 10.1017/S1471068417000217
– ident: S1471068418000534_ref62
  doi: 10.1017/S1471068416000569
– ident: S1471068418000534_ref110
  doi: 10.1145/321978.321991
– ident: S1471068418000534_ref9
– ident: S1471068418000534_ref91
– ident: S1471068418000534_ref42
  doi: 10.3233/FI-2016-1399
– ident: S1471068418000534_ref113
  doi: 10.1145/116825.116838
– ident: S1471068418000534_ref44
  doi: 10.1007/978-3-642-20895-9_37
– ident: S1471068418000534_ref3
  doi: 10.1007/978-3-319-23264-5_5
– ident: S1471068418000534_ref21
– volume: 25
  start-page: 105
  year: 2006
  ident: S1471068418000534_ref45
  article-title: Explanations and proof trees
  publication-title: Computers and Informatics
– ident: #cr-split#-S1471068418000534_ref81.1
– ident: S1471068418000534_ref94
– ident: S1471068418000534_ref77
  doi: 10.1017/S1471068410000256
– volume: 10021
  start-page: 577
  volume-title: Logics in Artificial Intelligence. JELIA 2016
  year: 2016
  ident: S1471068418000534_ref109
– ident: S1471068418000534_ref52
  doi: 10.1007/BF03037169
– volume: 13
  year: 2013
  ident: S1471068418000534_ref97
  article-title: ABA-based answer set justification
  publication-title: Theory and Practice of Logic Programming
– start-page: 1038
  volume-title: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)
  year: 1977
  ident: S1471068418000534_ref74
– ident: S1471068418000534_ref56
  doi: 10.1007/s11098-006-9057-9
– ident: S1471068418000534_ref4
  doi: 10.1007/3-540-57530-8_7
– ident: S1471068418000534_ref2
  doi: 10.1007/978-3-642-40564-8_6
– ident: S1471068418000534_ref64
  doi: 10.2307/2025310
– ident: S1471068418000534_ref58
  doi: 10.5840/jphil20091061128
– ident: S1471068418000534_ref99
  doi: 10.1017/S1471068414000702
– ident: S1471068418000534_ref107
– ident: S1471068418000534_ref18
  doi: 10.1017/S1471068416000107
– ident: S1471068418000534_ref51
– ident: S1471068418000534_ref53
  doi: 10.1609/aimag.v38i3.2741
– ident: S1471068418000534_ref72
  doi: 10.1007/BF03037396
– ident: S1471068418000534_ref10
  doi: 10.1007/978-3-540-72200-7_5
– ident: S1471068418000534_ref34
  doi: 10.1007/BF00283131
– start-page: 1
  year: 2010
  ident: S1471068418000534_ref26
  article-title: Graph representations of logic programs: Properties and comparison
  publication-title: Proceedings of the 6th Latin American Workshop on Non-Monotonic Reasoning
– start-page: 102
  volume-title: Proceedings of the 10th European conference on Artificial Intelligence (ECAI ’92)
  year: 1992
  ident: S1471068418000534_ref83
– ident: S1471068418000534_ref88
  doi: 10.1007/978-3-642-40564-8_45
– ident: S1471068418000534_ref46
  doi: 10.1007/978-3-642-40564-8_32
– ident: S1471068418000534_ref65
– ident: S1471068418000534_ref28
  doi: 10.1007/978-3-642-40564-8_53
– start-page: 31
  volume-title: Proceedings of the 26th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
  year: 2007
  ident: S1471068418000534_ref54
– ident: S1471068418000534_ref5
  doi: 10.1017/S1471068410000384
– ident: S1471068418000534_ref90
  doi: 10.1017/S1471068408003633
– ident: S1471068418000534_ref32
  doi: 10.1007/978-3-319-23264-5_22
– start-page: 198
  volume-title: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR’08)
  year: 2008
  ident: S1471068418000534_ref57
– ident: S1471068418000534_ref114
  doi: 10.1016/S0022-0000(05)80053-4
– volume-title: Algorithmic Program DeBugging
  year: 1983
  ident: S1471068418000534_ref100
  doi: 10.7551/mitpress/1192.001.0001
– volume: 1
  start-page: 66
  volume-title: Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1 (IJCAI’89)
  year: 1989
  ident: S1471068418000534_ref105
– ident: S1471068418000534_ref79
– ident: S1471068418000534_ref85
  doi: 10.1016/0743-1066(93)90032-C
– ident: S1471068418000534_ref71
– ident: S1471068418000534_ref16
– ident: S1471068418000534_ref68
  doi: 10.1017/S1471068417000345
– ident: S1471068418000534_ref86
  doi: 10.1007/BFb0019400
– start-page: 8
  volume-title: Proceedings of the 5th Workshop on Logic Programming Environments (LPE’93)
  year: 1993
  ident: S1471068418000534_ref102
– ident: S1471068418000534_ref78
  doi: 10.1007/978-3-642-20895-9_13
– ident: S1471068418000534_ref15
  doi: 10.1007/978-3-642-20832-4_21
– ident: S1471068418000534_ref95
  doi: 10.1007/978-3-319-23264-5_39
– ident: S1471068418000534_ref60
  doi: 10.1017/S1471068405002528
– start-page: 365
  year: 1993
  ident: S1471068418000534_ref33
  article-title: Justification semantics: A unifying framework for the semantics of logic programs
  publication-title: Proceedings of the 2nd International Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR’93)
  doi: 10.7551/mitpress/4307.003.0031
– ident: #cr-split#-S1471068418000534_ref81.2
– ident: S1471068418000534_ref103
  doi: 10.1111/j.1467-8640.1986.tb00079.x
– ident: S1471068418000534_ref14
  doi: 10.1017/S1471068413000410
– ident: S1471068418000534_ref101
– volume: 6300
  start-page: 488
  volume-title: Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday
  year: 2010
  ident: S1471068418000534_ref67
  doi: 10.1007/978-3-642-15025-8_24
– volume-title: Causation and Counterfactuals
  year: 2004
  ident: S1471068418000534_ref73
– volume: 2998
  start-page: 500
  volume-title: Functional and Logic Programming. FLOPS 2004
  year: 2003
  ident: S1471068418000534_ref82
– start-page: 448
  volume-title: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI’18)
  year: 2008
  ident: S1471068418000534_ref48
– ident: S1471068418000534_ref76
  doi: 10.1007/978-3-642-20895-9_45
– ident: S1471068418000534_ref112
  doi: 10.1145/308386.308444
– volume: 6
  start-page: 15
  year: 2016
  ident: S1471068418000534_ref6
  article-title: Justifications and blocking sets in a rule-based answer set computation
  publication-title: Technical Communications of the 32nd International Conference on Logic Programming (ICLP’16)
– ident: S1471068418000534_ref36
  doi: 10.1007/978-3-319-23264-5_24
– ident: S1471068418000534_ref11
– volume-title: The Art of Prolog: Advanced Programming Techniques
  year: 1994
  ident: S1471068418000534_ref104
– ident: S1471068418000534_ref37
  doi: 10.1007/978-0-387-98197-0_10
– ident: S1471068418000534_ref17
  doi: 10.1017/S1471068416000454
– ident: S1471068418000534_ref30
  doi: 10.1017/S1471068415000356
– volume: 8761
  start-page: 297
  volume-title: Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA’14)
  year: 2014
  ident: S1471068418000534_ref20
  doi: 10.1007/978-3-319-11558-0_21
– ident: S1471068418000534_ref41
  doi: 10.1017/S1471068416000466
– ident: S1471068418000534_ref106
– ident: S1471068418000534_ref98
– ident: S1471068418000534_ref63
  doi: 10.1145/1149114.1149117
SSID ssj0016324
Score 2.4157803
Snippet Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the...
SourceID hal
proquest
crossref
cambridge
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 114
SubjectTerms Artificial Intelligence
Computer Science
Cryptography
Decision making
Domains
Machine Learning
Mathematical programming
Problem solving
Solvers
Special Issue on User-Oriented Logic Programming and Reasoning Paradigms
Survey Article
Title Answering the “why” in answer set programming – A survey of explanation approaches
URI https://www.cambridge.org/core/product/identifier/S1471068418000534/type/journal_article
https://www.proquest.com/docview/2180951525
https://hal.science/hal-03032897
Volume 19
WOSCitedRecordID wos000458807300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58Hbz4FtcXQTyJxbZJ0_YkqyiCsiyisHgpTZOioN11u6562__gVf_c_hIzbbq-YC9eekgmpWQmM5Nk-n0Au8wLwiBg0kqE0hsUSWNLBwVuCZFyN5TaaaqCteTCbzSCVitsmgO33JRVVj6xcNSyneAZ-YGLQFMesvUcdh4tZI3C21VDoTEJ047rOmjn5741ukVAKPLi7yIfq3sCVt1qImQ0NmKbfi0aIvuOrfAjRk3eYoXkL0ddRJ_T-f9-9wLMmbyT1EtDWYQJlS3BfMXpQMwSX4ZWPcufC3hColNDMhy8P9--Dgcf5C4jcdFFctUjpqzrAeWGgzdSJ_lTt69eSTsl6qVzH5eHjKSCLFf5Clyfnlwdn1mGfcFKGLd7eocacJ9KoWLftlPPSULFqJB6u-RygVSjwktjxxGMUa54mupEMdCxLWGCU8pDQVdhKmtnag2Il3JECRIJ1xMtQhFTVzImPRnaytXiNdgfzX1k1lAelfVnfvRHVTWwK_VEiUEyR0KN-3FD9kZDOiWMxzjhHa3zkRwCcJ_VLyJs0y6R6i2q33dqsFnp--uTv5S9Pr57A2Z15hWWxWybMNXrPqktmEn6vbu8uw3TRyeN5uV2Yc362fRuPgEoF_eM
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB61oRJcKBQQKQVWVXupsOp412v7gFAEVKmaRj20UsTFeL1rtVJx0jgPcst_4Ap_gR-VX8KMH-kDKbceet2dtWzv7Dx2Z78PYEe4fuD7QluxMpigaB5Z6BSkpVQinUCj0TQ5a0nb63T8bjc4WYG_1V0YKqusbGJuqHUvpj3yfYeAplxi6_nUv7KINYpOVysKjUItjsx0gilb9vHwC87vruMcfD393LJKVgErFtIeYublS49rZSLPthO3EQdGcKUxDXCkIgpN5SZRo6GE4NLIJMEAyEebHQslOZeB4vjcVXgkBCZLuH5O3G-LUwuCPs9vM3lUTeSL6hSVIKqpkdrwM0jxxU0sh1s-cfWcKjLvOIbc2x2sP7T_9AyelnE1axYL4TmsmHQD1ivOClaasBfQbabZJIdfZBj6svns9-R8Op_9YRcpi_IulpkhK8vWfpDcfPaLNVk2GozNlPUSZn72L6NiE5VVkOwmewln9_J9r6CW9lLzGpibSEJBUrHEiVWBirijhdCuDmzjoHgdPizmOixtRBYW9XVe-J9q1MGu1CGMS6R2Igy5XDZkbzGkX8CULBPeRh1byBHAeKvZDqkNTT7HFNwbN-qwVenX9StfK9fm8u738Lh1etwO24edozfwBKPMoCjc24LacDAyb2EtHg8vssG7fAUx-H7fqvgPW4dPqg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Answering+the+%E2%80%9Cwhy%E2%80%9D+in+answer+set+programming+%E2%80%93+A+survey+of+explanation+approaches&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=FANDINNO%2C+JORGE&rft.au=Schulz%2C+Claudia&rft.date=2019-03-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=19&rft.issue=2&rft.spage=114&rft.epage=203&rft_id=info:doi/10.1017%2FS1471068418000534
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon