✦ LIBER ✦

Complexity results for standard benchmark domains in planning

✍ Scribed by Malte Helmert

Book ID: 108306942
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 515 KB
Volume: 143
Category: Article
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(02)00364-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Information requirements for e-maintenan

Information requirements for e-maintenance strategic planning: A benchmark study in complex production systems

✍ Marco Macchi; Marco Garetti 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Plan Realization for Complex Command Int

Plan Realization for Complex Command Interaction in the UNIX Help Domain

✍ Stephen J. Hegner 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 439 KB

Probabilistic complexity analysis for li

Probabilistic complexity analysis for linear problems in bounded domains

✍ Stefan Heinrich 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Temperature prediction for multi-dimensi

Temperature prediction for multi-dimensional domains in standard fire

✍ Wang, Zhi-Hua ;Tan, Kang Hai 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

SAT-based planning in complex domains: C

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

✍ Claudio Castellini; Enrico Giunchiglia; Armando Tacchella 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Planning as satisfiability is a very efficient technique for classical planning, i.e., for planning domains in which both the effects of actions and the initial state are completely specified. In this paper we present C-SAT, a SAT-based procedure capable of dealing with planning domains having incom

Results of a Standardized Technique and

Results of a Standardized Technique and Postoperative Care Plan for Laparoscopic Sigmoid Colectomy

✍ AnthonyJ. Senagore; HansJ. Duepree; ConorP. Delaney; KarenM. Brady; VictorW. Faz 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 640 KB