Author:
Jussila Toni,Biere Armin,Sinz Carsten,Kröning Daniel,Wintersteiger Christoph M.
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Stockmeyer, L.J.: The polynomial–time hierarchy. TCS 3, 1–22 (1976)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
3. Rintanen, J.: Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10, 323–352 (1999)
4. Otwell, C., Remshagen, A., Truemper, K.: An effective QBF solver for planning problems. In: MSV/AMCS, pp. 311–316. CSREA Press (2004)
5. Lecture Notes in Computer Science;E. Giunchiglia,2005
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献