Machine reasoning explainability

K Cyras, R Badrinath, SK Mohalik, A Mujumdar… - arXiv preprint arXiv …, 2020 - arxiv.org
As a field of AI, Machine Reasoning (MR) uses largely symbolic means to formalize and
emulate abstract reasoning. Studies in early MR have notably started inquiries into …

Evaluating contrastive explanations for ai planning with non-experts: a smart home battery scenario

Y Shi, K McAreavey, W Liu - 2022 27th international conference …, 2022 - ieeexplore.ieee.org
Smart home systems with AI planning functionality have the potential to improve the lives of
users. However, there is an emerging expectation that users should better understand and …

Explain it as simple as possible, but no simpler–Explanation via model simplification for addressing inferential gap

S Sreedharan, S Srivastava, S Kambhampati - Artificial Intelligence, 2025 - Elsevier
One of the core challenges of explaining decisions made by modern AI systems is the need
to address the potential gap in the inferential capabilities of the system generating the …

On partial satisfaction planning with total-order HTNs

G Behnke, D Speck, M Katz, S Sohrabi - Proceedings of the …, 2023 - ojs.aaai.org
Since its introduction, partial satisfaction planning (PSP), including both oversubscription
(OSP) and net-benefit, has received significant attention in the classical planning …

Foundations of Human-Aware Explanations for Sequential Decision-Making Problems

S Sreedharan - 2022 - search.proquest.com
Abstract Recent breakthroughs in Artificial Intelligence (AI) have brought the dream of
developing and deploying complex AI systems that can potentially transform everyday life …

Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning

M Steinmetz, S Thiébaux, D Höller… - Proceedings of the …, 2024 - ojs.aaai.org
Stochastic shortest path (SSP) problems are a common framework for planning under
uncertainty. However, the reactive structure of their solution policies is typically not easily …

Merge and Shrink Abstractions for Temporal Planning

M Brandao, A Coles, A Coles, J Hoffmann - Proceedings of the …, 2022 - ojs.aaai.org
Temporal planning is a hard problem that requires good heuristic and memoization
strategies to solve efficiently. Merge-and-shrink abstractions have been shown to serve as …

Formal explanations of neural network policies for planning

R Selvey, A Grastien, S Thiébaux - ICAPS 2023 Workshop on …, 2023 - openreview.net
Deep learning is increasingly used to learn policies for planning problems. However,
policies represented by neural networks are difficult to interpret, verify and trust. Existing …

Symbolic Search for Oversubscription Planning

D Speck, M Katz - Proceedings of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
The objective of optimal oversubscription planning is to find a plan that yields an end state
with a maximum utility while keeping plan cost under a certain bound. In practice, the …

Iterative Oversubscription Planning with Goal-Conflict Explanations: Scaling Up Through Policy-Guidance Approximation

R Eifler, D Fišer, A Siji, J Hoffmann - ECAI 2024, 2024 - ebooks.iospress.nl
In oversubscription planning (OSP), not all goals can be achieved. If a global optimization
objective is difficult to fix, then an iterative planning process in which users refine their …