\textit{Explain it as simple as possible, but no simpler} -- explanation via model simplification for addressing inferential gap
From MaRDI portal
Publication:7018387
Cites work
- ``Distance? Who cares? Tailoring merge-and-shrink heuristics to detect unsolvability
- Abstractions of random finite-state machines
- AI 2005: Advances in Artificial Intelligence
- Bounded-parameter Markov decision processes
- Dynamic programming and optimal control. Vol. 1.
- Equivalence notions and model minimization in Markov decision processes
- Explanation in artificial intelligence: insights from the social sciences
- Foundations of explanations as model reconciliation
- From skills to symbols: learning symbolic representations for abstract high-level planning
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 2243372 (Why is no real title available?)
- LAO*: A heuristic search algorithm that finds solutions with loops
- Macro-operators: A weak method for learning
- Performance Loss Bounds for Approximate Value Iteration with State Aggregation
- Planning in a hierarchy of abstraction spaces
- Predicting human behavior in unrepeated, simultaneous-move games
- The fast downward planning system
- The FF planning system: Fast plan generation through heuristic search
- The LAMA planner: guiding cost-based anytime planning with landmarks
- Using state abstractions to compute personalized contrastive explanations for AI agent behavior
- Weak, strong, and strong cyclic planning via symbolic model checking
This page was built for publication: \textit{Explain it as simple as possible, but no simpler} -- explanation via model simplification for addressing inferential gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018387)
