Pages that link to "Item:Q1341665"
From MaRDI portal
The following pages link to Downward refinement and the efficiency of hierarchical problem solving (Q1341665):
Displaying 10 items.
- Limitations of acyclic causal graphs for planning (Q490647) (← links)
- The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- Calculating criticalities (Q1391896) (← links)
- How to progress a database (Q1402735) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- Reverse Hoare Logic (Q3095238) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
