The emerging landscape of explainable ai planning and decision making

T Chakraborti, S Sreedharan… - arxiv preprint arxiv …, 2020 - arxiv.org
In this paper, we provide a comprehensive outline of the different threads of work in
Explainable AI Planning (XAIP) that has emerged as a focus area in the last couple of years …

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 …

Merge-and-shrink: A compositional theory of transformations of factored transition systems

S Sievers, M Helmert - Journal of Artificial Intelligence Research, 2021 - jair.org
The merge-and-shrink framework has been introduced as a general approach for defining
abstractions of large state spaces arising in domain-independent planning and related …

–d3wa+–a case study of xaip in a model acquisition task for dialogue planning

S Sreedharan, T Chakraborti, C Muise… - Proceedings of the …, 2020 - ojs.aaai.org
Recently, the D3WA system was proposed as a paradigm shift in how complex goal-oriented
dialogue agents can be specified by taking a declarative view of design. However, it turns …

[PDF][PDF] Towards compositional hardware model checking certification

E Yu, N Froleyks, A Biere… - 2023 Formal Methods in …, 2023 - library.oapen.org
In this paper, we revisit and formalize temporal decomposition, as one of the most basic,
widely-used and effective preprocessing techniques in hardware model checking. The main …

Engineering knowledge for automated planning: Towards a notion of quality

TL McCluskey, TS Vaquero, M Vallati - Proceedings of the 9th …, 2017 - dl.acm.org
Automated planning is a prominent Artificial Intelligence challenge, as well as being a
common capability requirement for intelligent autonomous agents. A critical aspect of what is …

[PDF][PDF] Strong Fully Observable Non-Deterministic Planning with LTL and LTLf Goals.

A Camacho, SA McIlraith - IJCAI, 2019 - ijcai.org
We are concerned with the synthesis of strategies for sequential decision-making in
nondeterministic dynamical environments where the objective is to satisfy a prescribed …

Formally verified solution methods for Markov decision processes

M Schäffeler, M Abdulaziz - Proceedings of the AAAI Conference on …, 2023 - ojs.aaai.org
We formally verify executable algorithms for solving Markov decision processes (MDPs) in
the interactive theorem prover Isabelle/HOL. We build on existing formalizations of …

Learning generalized unsolvability heuristics for classical planning

S Ståhlberg, G Francès, J Seipp - The Thirtieth International Joint …, 2021 - diva-portal.org
Recent work in classical planning has introduced dedicated techniques for detecting
unsolvable states, ie, states from which no goal state can be reached. We approach the …

Human-AI symbiosis: A survey of current approaches

Z Zahedi, S Kambhampati - arxiv preprint arxiv:2103.09990, 2021 - arxiv.org
In this paper, we aim at providing a comprehensive outline of the different threads of work in
human-AI collaboration. By highlighting various aspects of works on the human-AI team …