On the computational complexity of temporal projection, planning, and plan validation

Artificial Intelligence 66 (1):125-160 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Nonmonotonic logic and temporal projection.Steve Hanks & Drew McDermott - 1987 - Artificial Intelligence 33 (3):379-412.
O-Plan: The open planning architecture.Ken Currie & Austin Tate - 1991 - Artificial Intelligence 52 (1):49-86.

Analytics

Added to PP
2020-12-22

Downloads
16 (#1,199,504)

6 months
10 (#423,770)

Historical graph of downloads
How can I increase my downloads?