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

Celý popis

Podrobná bibliografie

Vydáno v:	Artificial intelligence Ročník 147; číslo 1; s. 85 - 117
Hlavní autoři:	Castellini, Claudio, Giunchiglia, Enrico, Tacchella, Armando
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.07.2003
Témata:	Artificial intelligence Concurrency Planning Planning under uncertainty SAT-based planning Satisfiability SAT-based planning Concurrency Planning under uncertainty Satisfiability
ISSN:	0004-3702, 1872-7921
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!