Complexity, Decidability and Undecidability Results for Domain-Independent Planning (1995)
Cached
Download Links
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [ftp.cs.umd.edu]
- [www.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
by
Kutluhan Erol
,
Dana S. Nau
,
V. S. Subrahmanian
| Venue: | ARTIFICIAL INTELLIGENCE |
| Citations: | 113 - 21 self |
BibTeX
@ARTICLE{Erol95complexity,decidability,
author = {Kutluhan Erol and Dana S. Nau and V. S. Subrahmanian},
title = {Complexity, Decidability and Undecidability Results for Domain-Independent Planning},
journal = {ARTIFICIAL INTELLIGENCE},
year = {1995},
volume = {76},
pages = {75--88}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show
