Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains

Cite

Text

Baral et al. "Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains." AAAI Conference on Artificial Intelligence, 2005.

Markdown

[Baral et al. "Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/baral2005aaai-using/)

BibTeX

@inproceedings{baral2005aaai-using,
  title     = {{Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains}},
  author    = {Baral, Chitta and Eiter, Thomas and Zhao, Jicheng},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {578-583},
  url       = {https://mlanthology.org/aaai/2005/baral2005aaai-using/}
}