Computational Complexity of Reasoning about Plans (1992)
| Citations: | 13 - 1 self |
BibTeX
@TECHREPORT{Bäckström92computationalcomplexity,
author = {Christer Bäckström and C Fl Christer Backstrom},
title = {Computational Complexity of Reasoning about Plans},
institution = {},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The artificial intelligence (AI) planning problem is known to be very hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. Many planning researchers claim that all this expressiveness is needed to solve real problems and some of them have abandoned theory-based planning methods in favour of seemingly more efficient methods. These methods usually lack a theoretical foundation so not much is known about the correctness and the computational complexity of these. There are, however, many applications where both provable correctness and efficiency are of major concern, for instance, within automatic control. We suggest in this thesis that it might be possible to stay within a wellfounded theoretical framework and still solve many interesting problems tractably. This should be done by identifying restrictions on the planning problem that improve the complexity figure while still allowing for interesting problems to be modelled. Findin...
Citations
No citations identified.
