Downward refinement and the efficiency of hierarchical problem solving
From MaRDI portal
Publication:1341665
DOI10.1016/0004-3702(94)90062-0zbMath0938.68829WikidataQ59679150 ScholiaQ59679150MaRDI QIDQ1341665
Publication date: 21 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(94)90062-0
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
The computational complexity of avoiding spurious states in state space abstraction, Calculating criticalities, How to progress a database, Reverse Hoare Logic
Cites Work
- Theorem proving with abstraction
- Automatically generating abstractions for planning
- Searching for an optimal path in a tree with random costs
- Planning in a hierarchy of abstraction spaces
- All I know: A study in autoepistemic logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item