The following pages link to (Q3455599):
Displaying 7 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- On-the-fly informed search of non-blocking directed controllers (Q2103713) (← links)
- A correctness result for synthesizing plans with loops in stochastic domains (Q2300450) (← links)
- The complexity of optimal monotonic planning: the bad, the good, and the causal graph (Q2871457) (← links)
- Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms (Q3020421) (← links)