A New Algorithm for Generative Planning
暂无分享,去创建一个
[1] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[2] Matthew L. Ginsberg. Bilattices and Modal Operators , 1990, J. Log. Comput..
[3] Matthew L. Ginsberg,et al. Approximate Planning , 1995, Artif. Intell..
[4] Richard E. Korf,et al. Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..
[5] Matthew L. Ginsberg,et al. Multivalued logics: a uniform approach to reasoning in artificial intelligence , 1988, Comput. Intell..
[6] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[7] Matthew L. Ginsberg,et al. Modality and interrupts , 1995, Journal of Automated Reasoning.
[8] David Chapman,et al. Planning for Conjunctive Goals , 1987, Artif. Intell..
[9] Oren Etzioni,et al. A Structural Theory of Explanation-Based Learning , 1993, Artif. Intell..
[10] Martha E. Pollack,et al. Passive and active decision postponement in plan generation , 1996 .
[11] Mark A. Peot,et al. Postponing Threats in Partial-Order Planning , 1993, AAAI.
[12] V. S. Subrahmanian,et al. Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..
[13] Bart Selman,et al. Near-Optimal Plans, Tractability, and Reactivity , 1994, KR.