Downward refinement and the efficiency of hierarchical problem solving
From MaRDI portal
Cites work
- All I know: A study in autoepistemic logic
- Automatically generating abstractions for planning
- scientific article; zbMATH DE number 4164177 (Why is no real title available?)
- scientific article; zbMATH DE number 4166913 (Why is no real title available?)
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 67459 (Why is no real title available?)
- scientific article; zbMATH DE number 67476 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3599517 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- Planning in a hierarchy of abstraction spaces
- Searching for an optimal path in a tree with random costs
- Theorem proving with abstraction
Cited in
(10)- Calculating criticalities
- How to progress a database
- Star-topology decoupled state space search
- A framework for analysing state-abstraction methods
- Reverse Hoare logic
- Limitations of acyclic causal graphs for planning
- Computational complexity of computing symmetries in finite-domain planning
- Abstraction for non-ground answer set programs
- The computational complexity of avoiding spurious states in state space abstraction
- New methods for proving the impossibility to solve problems through reduction of problem spaces
This page was built for publication: Downward refinement and the efficiency of hierarchical problem solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341665)
