[Kautz Selman1998] converts planning problems into
Boolean satisfiability problems, which are then solved using a variety
of different techniques. The user indicates which techniques should be
tried in what order. In constructing the satisfiability problem,
blackbox uses the planning graph constructed as in Graphplan. For
blackbox, we used version 2.5 and version 3.6b.
©2002 AI Access Foundation and Morgan Kaufmann
Publishers. All rights reserved.