Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Reference71 articles.
1. Planning as satisfiability;Kautz,1992
2. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158.
3. Pushing the envelope: planning, propositional logic, and stochastic search;Kautz,1996
4. Symbolic model checking without BDDs;Biere,1999
5. GRASP: a search algorithm for propositional satisfiability;Marques-Silva;IEEE Transactions on Computers,1999
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献