Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective
暂无分享,去创建一个
[1] Dana S. Nau,et al. Complexity Results for Blocks-World Planning , 1991, AAAI.
[2] Austin Tate,et al. Generating Project Networks , 1977, IJCAI.
[3] Georg Gottlob,et al. On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..
[4] James A. Hendler,et al. A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..
[5] Hector J. Levesque,et al. Abductive and Default Reasoning: A Computational Core , 1990, AAAI.
[6] Jana Koehler,et al. PHI - A Logic-Based Tool for Intelligent Help Systems , 1993, IJCAI.
[7] Bernhard Nebel,et al. Belief Revision and Default Reasoning: Syntax-Based Approaches , 1991, KR.
[8] Daniel S. Weld,et al. Systematic adaptation for case-based planning , 1992 .
[9] V. S. Subrahmanian,et al. On the Complexity of Domain-Independent Planning , 1992, AAAI.
[10] T. Bylander. Complexity results for extended planning , 1992 .
[11] Jana Koehler,et al. Deductive Planning and Plan Reuse in a Command Language Environment , 1992, ECAI.
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Georg Gottlob,et al. The complexity of logic-based abduction , 1993, JACM.
[14] Stephen V. Chenoweth. On the NP-Hardness of Blocks World , 1991, AAAI.
[15] Christer Bäckström,et al. Parallel Non-Binary Planning in Polynomial Time , 1991, IJCAI.
[16] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[17] Jana Koehler. Towards a logical treatment of plan reuse , 1992 .
[18] David Chapman,et al. Planning for Conjunctive Goals , 1987, Artif. Intell..
[19] Tom Bylander,et al. Complexity Results for Planning , 1991, IJCAI.
[20] Kristian J. Hammond,et al. Explaining and Repairing Plans that Fail , 1987, IJCAI.