Planning from Second Principles

Abstract Planning from second principles by reusing and modifying plans is one way of improving the efficiency of planning systems. In this paper, we study it in the general framework of deductive planning and develop a logical formalization of planning from second principles, which relies on a systematic decomposition of the planning process. Deductive inference processes with clearly defined semantics formalize each of the subtasks a second principles planner has to address. Plan modification, which comprises matching and adaptation tasks, is based on a deductive approach yielding provably correct modified plans. Description logics are introduced as query languages to plan libraries, which leads to a novel and efficient solution to the indexing problem in case-based reasoning. Apart from sequential plans, this approach enables a planner to reuse and modify complex plans containing control structures like conditionals and loops.

[1]  Christopher K. Riesbeck,et al.  Inside Case-Based Reasoning , 1989 .

[2]  Peter F. Patel-Schneider,et al.  A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic , 1993, J. Artif. Intell. Res..

[3]  Ingrid Zukerman,et al.  An Inductive Approach to Learning Search Control Rules for Planning , 1993, IJCAI.

[4]  Jana Koehler,et al.  Constraint Deduction in an Interval-based Temporal Logic , 1993, Executable Modal and Temporal Logics.

[5]  Amir Pnueli,et al.  A Choppy Logic , 1986, LICS.

[6]  Lincoln A. Wallen,et al.  Automated deduction in nonclassical logics , 1990 .

[7]  Subbarao Kambhampati,et al.  A Theory of Plan Modification , 1990, AAAI.

[8]  Jana Koehler,et al.  PHI - A Logic-Based Tool for Intelligent Help Systems , 1993, IJCAI.

[9]  Kristian J. Hammond,et al.  Explaining and Repairing Plans that Fail , 1987, IJCAI.

[10]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[11]  Drew McDermott,et al.  Planning and Acting , 1978, Cogn. Sci..

[12]  D. Litman,et al.  Subsumption and recognition of heterogeneous constraint networks , 1994, Proceedings of the Tenth Conference on Artificial Intelligence for Applications.

[13]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[14]  Zohar Manna,et al.  A THEORY OF PLANS , 1987 .

[15]  Jana Koehler,et al.  An Application of Terminological Logics to Case-based Reasoning , 1994, KR.

[16]  Susanne Biundo-Stephan,et al.  Multilevel Refinement Planning in an Interval-Based Temporal Logic , 1995, EPIA.

[17]  Franz Baader,et al.  KRIS: Knowledge Representation and Inference System , 1991, SGAR.

[18]  Hans Jürgen Ohlbach,et al.  Semantics-Based Translation Methods for Modal Logics , 1991, J. Log. Comput..

[19]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[20]  Piergiorgio Odifreddi,et al.  Logic and computer science , 1990 .

[21]  Jana Koehler,et al.  Flexible Plan Reuse in a Formal Framework , 1994 .

[22]  James A. Hendler,et al.  Flexible reuse and modification in hierarchical planning: a validation structure-based approach , 1989 .

[23]  Alan Bundy.  Proceedings of the Third International Conference on Artificial Intelligence Planning Systems , 1995 .

[24]  Zohar Manna,et al.  Reasoning in Interval Temporal Logic , 1983, Logic of Programs.

[25]  Bernhard Nebel,et al.  Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis , 1995, Artif. Intell..

[26]  L. Siklóssy,et al.  Proceedings of the 10th European conference on artificial intelligence , 1993 .

[27]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[28]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[29]  Hiroaki Kitano,et al.  Massively Parallel Artificial Intelligence , 1991, IJCAI.

[30]  James A. Hendler,et al.  Massively parallel matching of knowledge structures , 1994 .

[31]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[32]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[33]  Christer Bäckström,et al.  Current Trends in AI Planning , 1994 .

[34]  Maritta Heisel,et al.  Tactical Theorem Proving in Program Verification , 1990, CADE.

[35]  Bernhard Nebel,et al.  Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective , 1993, IJCAI.

[36]  Manuela M. Veloso,et al.  Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.

[37]  Christer Bäckström.  Finding Least Constrained Plans and Optimal Parallel Executions is Harder than We Thought , 1994 .

[38]  Daniel S. Weld,et al.  A Domain-Independent Algorithm for Plan Adaptation , 1994, J. Artif. Intell. Res..

[39]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[40]  Daniel S. Weld,et al.  Systematic adaptation for case-based planning , 1992 .

[41]  Bart Selman,et al.  Near-Optimal Plans, Tractability, and Reactivity , 1994, KR.

[42]  Raymond Reiter,et al.  Proving Properties of States in the Situation Calculus , 1993, Artif. Intell..

[43]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[44]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[45]  Jana Koehler.  Correct Modification of Complex Plans , 1994, ECAI.

[46]  Michael Beetz,et al.  Improving Robot Plans During Their Execution , 1994, AIPS.

[47]  Dietmar Dengler.  An Adaptive Deductive Planning System , 1994, ECAI.

[48]  James A. Hendler,et al.  Control of Refitting during Plan Reuse , 1989, IJCAI.

[49]  Bernhard Nebel,et al.  Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning , 1992 .

[50]  E. Feigenbaum,et al.  Computers and Thought , 1963 .

[51]  Paolo Traverso,et al.  Beyond the Single Planning Paradigm: Introspective Planning , 1992, ECAI.

[52]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[53]  Fred Krögr.  Temporal Logic Of Programs , 1987 .

[54]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[55]  Jana Koehler,et al.  Avoiding Pitfalls in Case-based Planning , 1994, AIPS.

[56]  Robert Givan,et al.  New Results on Local Inference Relations , 1992, KR.

[57]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[58]  Jana Koehler,et al.  Deductive Planning and Plan Reuse in a Command Language Environment , 1992, ECAI.