登入選單

返回Google圖書搜尋

Complexity, Decidability and Undecidability Results for Domain-independent Planning

University of Maryland at College Park. Department of Computer ScienceK. ErolD. S. NauV. S. Subrahmanian

出版	University of Maryland. Systems Research Center, 1991
URL	http://books.google.com.hk/books?id=7IJwHAAACAAJ&hl=&source=gbs_api

註釋

For those cases where planning is decidable, we show how the time complexity varies depending on a wide variety of conditions: whether or not function symbols are allowed; whether or not delete lists are allowed; whether or not negative preconditions are allowed; whether or not the predicates are restricted to be propositional (i.e., 0-ary); whether the planning operators are given as part of the input to the planning problem, or instead are fixed in advance."