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

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 inc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Artificial intelligence Jg. 147; H. 1; S. 85 - 117
Hauptverfasser:	Castellini, Claudio, Giunchiglia, Enrico, Tacchella, Armando
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2003
Schlagworte:	Artificial intelligence Concurrency Planning Planning under uncertainty SAT-based planning Satisfiability SAT-based planning Concurrency Planning under uncertainty Satisfiability
ISSN:	0004-3702, 1872-7921
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!