SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

Artificial Intelligence 147 (1-2):85-117 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

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
6 (#1,485,580)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?