Resolving Non-Determinism in Programs for Complex Task Planning with Search Control

Alfredo Gabaldon. Resolving Non-Determinism in Programs for Complex Task Planning with Search Control. In Logical Formalizations of Commonsense Reasoning, Papers from the 2007 AAAI Spring Symposium, Technical Report SS-07-05, Stanford, California, USA, March 26-28, 2007. pages 47-52, AAAI, 2007. [doi]

@inproceedings{Gabaldon07,
  title = {Resolving Non-Determinism in Programs for Complex Task Planning with Search Control},
  author = {Alfredo Gabaldon},
  year = {2007},
  url = {http://www.aaai.org/Library/Symposia/Spring/2007/ss07-05-009.php},
  researchr = {https://researchr.org/publication/Gabaldon07},
  cites = {0},
  citedby = {0},
  pages = {47-52},
  booktitle = {Logical Formalizations of Commonsense Reasoning, Papers from the 2007 AAAI Spring Symposium, Technical Report SS-07-05, Stanford, California, USA, March 26-28, 2007},
  publisher = {AAAI},
}