On the Nature of Modal Truth Criteria in Planning

Chapman's paper, "Planning for Conjunctive Goals," has been widely acknowledged for its contribution toward understanding the nature of nonlinear (partial-order) planning, and it has been one of the bases of later work by others—but it is not free of problems. This paper addresses some problems involving modal truth and the Modal Truth Criterion (MTC). Our results are as follows: 1. Even though modal duality is a fundamental axiom of classical modal logics, it does not hold for modal truth in Chapman's plans; i.e., "necessarily p" is not equivalent to "not possibly p." 2. Although the MTC for necessary truth is correct, the MTC for possible truth is incorrect: it provides necessary but insufficient conditions for ensuring possible truth. Furthermore, even though necessary truth can be determined in polynomial time, possible truth is NP-hard. 3. If we rewrite the MTC to talk about modal conditional truth (i.e., modal truth conditional on executability) rather than modal truth, then both the MTC for necessary conditional truth and the MTC for possible conditional truth are correct; and both can be computed in polynomial time.

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

[2]  Qiang Yang,et al.  ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner , 1990, AAAI.

[3]  Subbarao Kambhampati,et al.  A Unified Framework for Explanation-Based Generalization of Partially Ordered and Partially Instantiated Plans , 1994, Artif. Intell..

[4]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[7]  Stanley J. Rosenschein,et al.  Plan Synthesis: A Logical Perspective , 1981, IJCAI.

[8]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection, Planning, and Plan Validation , 1994, Artif. Intell..

[9]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[10]  Mark S. Boddy,et al.  Reasoning About Partially Ordered Events , 1988, Artificial Intelligence.

[11]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[12]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection and Plan Validation , 1992, AAAI.

[13]  Ernest Davis,et al.  Representations of commonsense knowledge , 2014, notThenot Morgan Kaufmann series in representation and reasoning.

[14]  Subbarao Kambhampati,et al.  On the Nature and Role of Modal Truth Criteria in Planning , 1996, Artif. Intell..