Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

Artificial Intelligence 132 (2):151-182 (2001)
  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,551

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

Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,326,944)

6 months
5 (#1,053,842)

Historical graph of downloads
How can I increase my downloads?