• Corpus ID: 198187725

Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems

  title={Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems},
  author={Thomas Eiter and Zeynep Gozen Saribatur and Peter Sch{\"u}ller},
Humans are capable of abstracting away irrelevant details when studying problems. [] Key Result A user study on abstract explanations confirms the similarity of the focus points in machine vs. human explanations and reaffirms the challenge of employing abstraction to obtain machine explanations.

Figures and Tables from this paper

Abstraction for ASP Planning
The potential use of such an abstraction in getting to the essence of planning problems, expressed in ASP, by disregarding irrelevant details and computing abstract plans is highlighted.
A Semantic Perspective on Omission Abstraction in ASP
This work distinguishes the key conditions for omission abstraction which sheds light on the differences to the well-studied notion of forgetting, and demonstrates how omission abstraction fits into the overall spectrum.
Towards Comprehensible ASP Reasoning by Means of Abstraction
This work highlights the potential of the recently introduced abstraction concept in ASP towards tackling this problem, by focusing on the relevant details of the reasoning task that can allow for better human comprehensibility.
The Emerging Landscape of Explainable Automated Planning & Decision Making
A comprehensive outline of the different threads of work in Explainable AI Planning (XAIP) is provided and it is hoped that the survey will provide guidance to new researchers in automated planning towards the role of explanations in the effective design of human-in-the-loop systems.
What Do We Want From Explainable Artificial Intelligence (XAI)?
A model is provided that explicitly spells out the main concepts and relations necessary to consider and investigate when evaluating, adjusting, choosing, and developing explainability approaches that aim to satisfy stakeholders’ desiderata and can serve researchers from the variety of different disciplines involved in XAI as a common ground.
Exploring Explainability: A Definition, a Model, and a Knowledge Catalogue
An interdisciplinary Systematic Literature Review is conducted and a definition, a model, and a catalogue for explainability are proposed that illustrate how explainability interacts with other quality aspects and how it may impact various quality dimensions of a system.


Omission-Based Abstraction for Answer Set Programs
This work introduces a method to automatically abstract ASP programs that preserves their structure by reducing the vocabulary while ensuring an over-approximation, which allows for generating partial answer set candidates that can help with approximation of reasoning.
Abstraction for Non-ground Answer Set Programs
A method to automatically abstract non-ground ASP programs given an abstraction over the domain is introduced, which ensures that each original answer set is mapped to some abstract answer set.
Merge-and-Shrink Abstraction
Many areas of computer science require answering questions about reachability in compactly described discrete transition systems. Answering such questions effectively requires techniques to be able
Why Can't You Do That HAL? Explaining Unsolvability of Planning Tasks
It is shown that hierarchical abstractions can be used to efficiently generate reasons for unsolvability of planning problems and the validity of the methods as well as their computational efficacy on a number of benchmark planning domains.
Answering the “why” in answer set programming – A survey of explanation approaches
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 are given, and highlight their similarities and differences.
Catching the Ouroboros: On debugging non-ground answer-set programs
This paper addresses the central debugging question why some interpretation is not an answer set, using a uniform encoding of a debugging request in terms of ASP itself, and discusses a debugging technique directly geared towards non-ground programs.
Generalized Planning via Abstraction: Arbitrary Numbers of Objects
It is shown how to adapt fully observable nondeterministic planning techniques to produce generalized solutions that are easy to instantiate over particular problem instances and how to reformulate a classical planning problem into a quantified one.
Planning in a Hierarchy of Abstraction Spaces
A Meta-Programming Technique for Debugging Answer-Set Programs
This paper introduces a meta-programming technique for debugging in ASP that respects the declarative nature of ASP, and the capabilities of the system can easily be extended to incorporate differing debugging features.
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP) and many of them do not satisfy desirable criteria, such as minimality or coincidence with answer sets in the aggregate-free case.