Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game

Peter Kissmann, Stefan Edelkamp. Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game. In Bärbel Mertsching, Marcus Hund, Muhammad Zaheer Aziz, editors, KI 2009: Advances in Artificial Intelligence, 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings. Volume 5803 of Lecture Notes in Computer Science, pages 1-8, Springer, 2009. [doi]

@inproceedings{KissmannE09,
  title = {Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game},
  author = {Peter Kissmann and Stefan Edelkamp},
  year = {2009},
  doi = {10.1007/978-3-642-04617-9_1},
  url = {http://dx.doi.org/10.1007/978-3-642-04617-9_1},
  tags = {translation},
  researchr = {https://researchr.org/publication/KissmannE09},
  cites = {0},
  citedby = {0},
  pages = {1-8},
  booktitle = {KI 2009: Advances in Artificial Intelligence, 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings},
  editor = {Bärbel Mertsching and Marcus Hund and Muhammad Zaheer Aziz},
  volume = {5803},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-04616-2},
}