Why can't you do that hal? explaining unsolvability of planning tasks

S Sreedharan, S Srivastava, D Smith… - … Joint Conference on …, 2019 - par.nsf.gov
Explainable planning is widely accepted as a pre-requisite for autonomous agents to
successfully work with humans. While there has been a lot of research on generating …

Using state abstractions to compute personalized contrastive explanations for AI agent behavior

S Sreedharan, S Srivastava, S Kambhampati - Artificial Intelligence, 2021 - Elsevier
There is a growing interest within the AI research community in developing autonomous
systems capable of explaining their behavior to users. However, the problem of computing …

Bridging the gap: Providing post-hoc symbolic explanations for sequential decision-making problems with inscrutable representations

S Sreedharan, U Soni, M Verma, S Srivastava… - arXiv preprint arXiv …, 2020 - arxiv.org
As increasingly complex AI systems are introduced into our daily lives, it becomes important
for such systems to be capable of explaining the rationale for their decisions and allowing …

[PDF][PDF] Optimal planning modulo theories

F Leofante - 2020 - publications.rwth-aachen.de
Planning for real-world applications requires algorithms and tools with the ability to handle
the complexity such scenarios entail. However, meeting the needs of such applications …

[HTML][HTML] Abstraction for non-ground answer set programs

ZG Saribatur, T Eiter, P Schüller - Artificial Intelligence, 2021 - Elsevier
Abstraction is an important technique utilized by humans in model building and problem
solving, in order to figure out key elements and relevant details of a world of interest. This …

Omission-based abstraction for answer set programs

ZG Saribatur, T Eiter - Theory and Practice of Logic Programming, 2021 - cambridge.org
Abstraction is a well-known approach to simplify a complex problem by over-approximating
it with a deliberate loss of information. It was not considered so far in Answer Set …

Symbolic planning with edge-valued multi-valued decision diagrams

D Speck, F Geißer, R Mattmüller - Proceedings of the International …, 2018 - ojs.aaai.org
Symbolic representations have attracted significant attention in optimal planning. Binary
Decision Diagrams (BDDs) form the basis for symbolic search algorithms. Closely related …

Extending classical planning with state constraints: Heuristics and search for optimal planning

P Haslum, F Ivankovic, M Ramirez, D Gordon… - Journal of Artificial …, 2018 - jair.org
We present a principled way of extending a classical AI planning formalism with systems of
state constraints, which relate-sometimes determine-the values of variables in each state …

State-dependent cost partitionings for cartesian abstractions in classical planning

T Keller, F Pommerening, J Seipp, F Geißer - KI 2016: Advances in …, 2016 - Springer
Abstraction heuristics are a popular method to guide optimal search algorithms in classical
planning. Cost partitionings allow to sum heuristic estimates admissibly by partitioning …

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 …