Abstract
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 not 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, possibletruth 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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the National Conference on Artificial Intelligence |
| Place of Publication | Menlo Park, CA, United States |
| Publisher | AAAI |
| Pages | 1055-1060 |
| Number of pages | 6 |
| Volume | 2 |
| State | Published - 1994 |
| Event | Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) - Seattle, WA, USA Duration: Jul 31 1994 → Aug 4 1994 |
Other
| Other | Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) |
|---|---|
| City | Seattle, WA, USA |
| Period | 7/31/94 → 8/4/94 |
ASJC Scopus subject areas
- Software