Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning

Nissim, Raz and Hoffmann, Jörg and Helmert, Malte
(2011) Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning.
In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011.
Conference: IJCAI - International Joint Conference on Artificial Intelligence

Full text not available from this repository.
Official URL: https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-...

Actions

Actions (login required)

View Item View Item