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

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/aaai/BaralEZ05, title={Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains}, pages={578-583}, year={2005}, crossref={DBLP:conf/aaai/2005}, booktitle={AAAI}, url={http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2005.html#BaralEZ05}, author={Chitta Baral and Thomas Eiter and Jicheng Zhao} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Using_SAT_and_Logic_Programming_to_Design_Polynomial-Time_Algorithms_for_Planning_in_Non-Deterministic_Domains"