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

Full description

Bibliographic Details

Published in:	Artificial intelligence Vol. 147; no. 1; pp. 85 - 117
Main Authors:	Castellini, Claudio, Giunchiglia, Enrico, Tacchella, Armando
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2003
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!