Planning for conjunctive goals
Artificial Intelligence
Reasoning about partially ordered events
Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning
Complexity, decidability and undecidability results for domain-independent planning
On the computational complexity of planning and story understanding
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Complexity results for planning
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
One kind of temporal reasoning is temporal projection-the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as story understanding, planning, and plan validation. We show that one particular simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured. However, given the restrictions of this problem, story understanding, planning, and plan validation appear to be easy. In fact, we show that plan validation, one of the intended applications of temporal projection, is tractable for an even larger class of plans.