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-...
Item Type: Conference or Workshop Item (A Paper) (Paper)
Conference: IJCAI International Joint Conference on Artificial Intelligence
Depositing User: Sebastian Weisgerber
Date Deposited: 22 Feb 2018 11:11
Last Modified: 23 Feb 2018 09:16
URI: https://publications.cispa.saarland/id/eprint/1973

Actions

Actions (login required)

View Item View Item
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.