Author:
Frank Jeremy,Jónsson Ari K.,Morris Paul
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. A. Blum and M. Furst. ”fast planning through planning graph analysis”. Artificial Intelligence, 90:281–300, 1997.
2. R. Bayardo and D. Miranker. A complexity analysis of space bounded learning algorithms for the constraint satisfaction problem. Proceedings of the 13th National Conference on Artificial Intelligence, pages 298–304, 1996.
3. M. B. Do and S. Khambhampati. Solving planning-graph by compiling it into csp. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, 2000.
4. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–94, 1991.
5. M. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25–46, 1993.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献