Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Contrastive Explanations for Answer-Set Programs
Knowledge-based Systems Group, Institute for Logic and Computation, TU Wien, Vienna, Austria.
Knowledge-based Systems Group, Institute for Logic and Computation, TU Wien, Vienna, Austria.
Knowledge-based Systems Group, Institute for Logic and Computation, TU Wien, Vienna, Austria.ORCID iD: 0000-0002-9902-7662
2023 (English)In: Logics in Artificial Intelligence: 18th European Conference, JELIA 2023, Dresden, Germany, September 20–22, 2023, Proceedings / [ed] S. Gaggl, M. V. Martinez & M. Ortiz, Springer, 2023, p. 73-89Conference paper, Published paper (Refereed)
Abstract [en]

Answer-Set Programming (ASP) is a popular declarative reasoning and problem solving formalism. Due to the increasing interest in explainability, several explanation approaches have been developed for ASP. However, while those formalisms are correct and interesting on their own, most are more technical and less oriented towards philosophical or social concepts of explanation. In this work, we study the notion of contrastive explanation, i.e., answering questions of the form “Why P instead of Q?”, in the context of ASP. In particular, we are interested in answering why atoms are included in an answer set, whereas others are not. Contrastive explainability has recently become popular due to its strong support from the philosophical, cognitive, and social sciences and its apparent ability to provide explanations that are concise and intuitive for humans. We formally define contrastive explanations for ASP based on counterfactual reasoning about programs. Furthermore, we demonstrate the usefulness of the concept on example applications and give some complexity results. The latter also provide a guideline as to how the explanations can be computed in practice.

Place, publisher, year, edition, pages
Springer, 2023. p. 73-89
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 14281
Keywords [en]
Philosophical aspects, Answer set, Answer set programming, Complexity results, Counterfactuals, Problem-solving, Reasoning about programs, Social concepts, Logic programming
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hj:diva-63553DOI: 10.1007/978-3-031-43619-2_6Scopus ID: 2-s2.0-85174482316ISBN: 9783031436185 (print)OAI: oai:DiVA.org:hj-63553DiVA, id: diva2:1838586
Conference
18th European Conference, JELIA 2023, Dresden, Germany, September 20–22, 2023
Available from: 2024-02-16 Created: 2024-02-16 Last updated: 2024-02-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Oetsch, Johannes

Search in DiVA

By author/editor
Oetsch, Johannes
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf