ML Anthology

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

Raz Nissim, Jörg Hoffmann, Malte Helmert
IJCAI 2011 pp. 1983-1990
doi:10.5591/978-1-57735-516-8/IJCAI11-331 /ijcai/2011/nissim2011ijcai-computing/
IJCAI Semantic Scholar

Cite

Text

Nissim et al. "Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-331

Markdown

[Nissim et al. "Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/nissim2011ijcai-computing/) doi:10.5591/978-1-57735-516-8/IJCAI11-331

BibTeX

@inproceedings{nissim2011ijcai-computing,
  title     = {{Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning}},
  author    = {Nissim, Raz and Hoffmann, Jörg and Helmert, Malte},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {1983-1990},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-331},
  url       = {https://mlanthology.org/ijcai/2011/nissim2011ijcai-computing/}
}