Author:
Ortlieb Manuela,Mattmüller Robert
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bercher, P., Mattmüller, R.: A planning graph heuristic for forward-chaining adversarial planning. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 921–922 (2008)
2. LNAI;P. Bercher,2009
3. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)
4. Bryce, D., Kambhampati, S., Smith, D.E.: Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research 26, 35–99 (2006)
5. Bylander, T.: The computational complexity of propositional strips planning. Artificial Intelligence 69(1-2), 165–204 (1994)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献