Pages that link to "Item:Q1846747"

The following pages link to Planning in a hierarchy of abstraction spaces (Q1846747):

Displaying 46 items.

• Exact decomposition approaches for Markov decision processes: a survey (Q606196) (← links)
• The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← links)
• Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
• Experiments with proof plans for induction (Q809617) (← links)
• A problem-decomposition method using differences or equivalence relations between states (Q1058310) (← links)
• Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
• Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
• Planning parallel actions (Q1128648) (← links)
• Using patterns and plans in chess (Q1145516) (← links)
• Theorem proving with abstraction (Q1149799) (← links)
• Gazing: An approach to the problem of definition and lemma use (Q1197385) (← links)
• Reasoning about model accuracy (Q1199915) (← links)
• A theory of abstraction (Q1199923) (← links)
• Model verification and improvement using DISPROVER (Q1215412) (← links)
• A language and a program for stating and solving combinatorial problems (Q1245009) (← links)
• Multiple perspective dynamic decision making (Q1274561) (← links)
• A linguistic approach to geometric reasoning (Q1309724) (← links)
• The inevitability of inconsistent abstract spaces (Q1311395) (← links)
• Translations of network languages (Q1324385) (← links)
• Automatically generating abstractions for planning (Q1332851) (← links)
• Multi-contributor causal structures for planning: A formalization and evaluation (Q1337681) (← links)
• Downward refinement and the efficiency of hierarchical problem solving (Q1341665) (← links)
• Causal approximations (Q1342225) (← links)
• Engineering and compiling planning domain models to promote validity and efficiency (Q1389595) (← links)
• Calculating criticalities (Q1391896) (← links)
• Abstraction and approximate decision-theoretic planning. (Q1399130) (← links)
• Star-topology decoupled state space search (Q1749386) (← links)
• Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
• Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
• Knowledge-based proof planning (Q1978469) (← links)
• Using state abstractions to compute personalized contrastive explanations for AI agent behavior (Q2060687) (← links)
• A framework for analysing state-abstraction methods (Q2060741) (← links)
• Model construction operators (Q2172762) (← links)
• Backdoors to planning (Q2321271) (← links)
• On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
• Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162) (← links)
• Dynamic backward reasoning systems (Q2638814) (← links)
• Knowledge-based programs as building blocks for planning (Q2667817) (← links)
• Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy (Q3449233) (← links)
• Spatial planning for musical output (Q3491572) (← links)
• (Q4028785) (← links)
• A PLAN FORMATION SYSTEM FOR ASSEMBLY ROBOTS (Q4198091) (← links)
• Omission-Based Abstraction for Answer Set Programs (Q4957218) (← links)
• A Sufficient Statistic for Influence in Structured Multiagent Environments (Q5856481) (← links)
• Abstraction for non-ground answer set programs (Q5919127) (← links)
• Reward-respecting subtasks for model-based reinforcement learning (Q6088325) (← links)