Downward refinement and the efficiency of hierarchical problem solving

Artificial Intelligence 71 (1):43-100 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,314

External links

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

Through your library

Analytics

Added to PP
2020-12-22

Downloads
24 (#1,006,363)

6 months
5 (#852,111)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
How to progress a database.Fangzhen Lin & Ray Reiter - 1997 - Artificial Intelligence 92 (1-2):131-167.
Calculating criticalities.A. Bundy, F. Giunchiglia, R. Sebastiani & T. Walsh - 1996 - Artificial Intelligence 88 (1-2):39-67.
Star-topology decoupled state space search.Daniel Gnad & Jörg Hoffmann - 2018 - Artificial Intelligence 257 (C):24-60.

View all 9 citations / Add more citations

References found in this work

Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
All I know: A study in autoepistemic logic.Hector J. Levesque - 1990 - Artificial Intelligence 42 (2-3):263-309.
Planning with constraints.Mark Stefik - 1981 - Artificial Intelligence 16 (2):111-139.
Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.

View all 8 references / Add more references