Synthesizing Customized Planners from Speci cationsBiplav Srivastava biplav
暂无分享,去创建一个
[1] Daniel S. Weld,et al. UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.
[2] Carla P. Gomes. PLANNING IN KIDS , 1995 .
[3] Subbarao Kambhampati,et al. Understanding and Extending Graphplan , 1997, ECP.
[4] Fahiem Bacchus,et al. Using temporal logic to control search in a forward chaining planner , 1996 .
[5] Subbarao Kambhampati,et al. A structured approach for synthesizing planners from specifications , 1997, Proceedings 12th IEEE International Conference Automated Software Engineering.
[6] Subbarao Kambhampati,et al. Refinement Planning as a Unifying Framework for Plan Synthesis , 1997, AI Mag..
[7] Eugene Fink,et al. Formalizing the PRODIGY planning algorithm , 1996 .
[8] Eugene Fink,et al. Prodigy Planning Algorithm , 1994 .
[9] Douglas R. Smith,et al. Synthesis of schedulers for planned shutdowns of power plants , 1996, Proceedings of the 11th Knowledge-Based Software Engineering Conference.
[10] Subbarao Kambhampati,et al. Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..
[11] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[12] David A. McAllester,et al. Systematic Nonlinear Planning , 1991, AAAI.
[13] Subbarao Kambhampati,et al. A comparative analysis of partial order planning and task reduction planning , 1995, SGAR.
[14] Douglas R. Smith,et al. Transformational approach to transportation scheduling , 1993, Proceedings of 8th Knowledge-Based Software Engineering Conference.
[15] Subbarao Kambhampati,et al. Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach , 1996, Artif. Intell..
[16] S. Kambhampati,et al. Universal classical planner: an algorithm for unifying state-space and plan-space planning , 1996 .
[17] Steven Minton,et al. Learning search control knowledge , 1988 .
[18] Douglas R. Smith,et al. ITAS: A Portable, Interactive Transportation Scheduling Tool Using a Search Engine Generated from Formal Specifications , 1996, AIPS.
[19] Masazumi Yoshikawa,et al. A Constraint-Based Approach to High-School Timetabling Problems: A Case Study , 1994, AAAI.
[20] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[21] Steven Minton,et al. Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..
[22] Rodney J. Douglas. KIDS: A Semi-Automatic Program Development System , 1990 .
[23] Douglas R. Smith,et al. KIDS: A Semiautomatic Program Development System , 1990, IEEE Trans. Software Eng..
[24] Jean-Louis Laurière,et al. A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..
[25] Anthony Barrett,et al. Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.
[26] Jaime G. Carbonell,et al. Learning effective search control knowledge: an explanation-based approach , 1988 .
[27] Austin Tate,et al. Generating Project Networks , 1977, IJCAI.
[28] Subbarao Kambhampati,et al. On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning , 1996, KR.
[29] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.