Downward refinement and the efficiency of hierarchical problem solving

DOI10.1016/0004-3702(94)90062-0zbMath0938.68829OpenAlexW2019310097WikidataQ59679150 ScholiaQ59679150MaRDI QIDQ1341665

Fahiem Bacchus, Qiang Yang

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

Calculating criticalities ⋮ The computational complexity of avoiding spurious states in state space abstraction ⋮ How to progress a database ⋮ Limitations of acyclic causal graphs for planning ⋮ Star-topology decoupled state space search ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ Abstraction for non-ground answer set programs ⋮ A framework for analysing state-abstraction methods ⋮ Reverse Hoare Logic ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning

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

This page was built for publication: Downward refinement and the efficiency of hierarchical problem solving