
## References

ackstrom,  ., 
Intelligence, 11 abarro, J.

alca ar, J. L.,  a ,  ,
erlin.

ast planning through planning graph analysis. Artificial lum,  . L .,
urst, L.

Intelligence, 90       ,
0.

ryant, grams.  ACM Computing Surveys, 24
. The computational comple ity of propositional  T   P   planning.

ylander, T.

Artificial Intelligence, 69 0.

-
adoli,   .,   iovanardi,   .,     chaerf, olean formulae.  n Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp.

imatti,    overi,   .,    Traverso, P.

based generation of universal plans in non deterministic domains.   n Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp.

avis,    ., Logemann,   .,     Loveland,                            machine program for theorem proving.

Communications of the ACM, 5, Improvements to Propositional Satisfiability Search Algorithms.

reeman, J.

.

Ph. . thesis, University of Pennsylvania.

chubert, L. 

erevini, 111 planning. n Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp.  0 plication of theorem proving to problem solving.  n   alker, reen, x Norton, L.

Artificial Intelligence, pp.

ashington,   .

elman, . . . Planning as satisfiability.  n Neumann,  . . . . . Proceedaut , a ings of the 10th European Conference on Artificial Intelligence, pp.

ien, ustria. John   iley ons.

aut , , ,
elman,  . 

stochastic search.  n Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Confer0 enlo Park, alifornia.

Press / The   T Press.
ence, pp.