a SAT technology planning system:
blackbox = satplan + graphplan

Source - Version 45

Linux Binary Version 43

Windows Binary Version 42
requires Cygwin

Mac OS X Binary Version 45

.
Blackbox is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solving the problems with a variety of state-of-the-art satisfiability engines. The front-end employs the graphplan system (Blum and Furst 1995). There is extreme flexibility in specifying the engines to use. For example, you can tell it to use walksat (Selman, Kautz, and Cohen 1994) for 60 seconds, and if that fails, then satz (Li and Anbulagan 1997) for 1000 seconds. This gives blackbox the capability of functioning efficiently over a broad range of problems. The name blackbox refers to the fact that the plan generator knows nothing about the SAT solvers, and the SAT solvers know nothing about plans: each is a "black box" to the other.

installing blackbox

using blackbox

To get started, try:

Blackbox has many options.   For help, run Blackbox with no options. Blackbox can print the the Boolean formula (in cnf or literal form), the mapping from literals to propositions, the model found, and the plan. For example, the following prints the formula generated by the problem blocks.facts.easy in cnf format:

The best solver to use is Chaff. Version 45 and newer use Chaff by default. For earlier versions, specify it on the command line:

the PDDL input language

Problem domains and problem instances are specifed using the STRIPS subset of the Planning Domain Definition Language (PDDL).  The easiest way to learn the language is to explore the example instances and read:

Blackbox differs from the offical language in the following ways:

controlling the SAT encoding

The option -axoms N specifies what kinds of axioms are generated, where N is a sum of the following:

The -axioms flag takes either a numeric argument or one of the following keywords:

credits

references

Henry Kautz and Bart Selman (1999). Unifying SAT-based and Graph-based Planning.Proc. IJCAI-99.
A. Blum and M.L. Furst (1995). Fast planning through planning graph analysis. Proc. IJCAI-95.
M.D. Ernst, T.D. Millstein, and D.S. Weld (1997). Automatic SAT-compilation of planning problems. Proc. IJCAI-97.
Henry Kautz and Bart Selman (1999). Unifying SAT-based and Graph-based Planning. Proc. IJCAI-99, Stockholm.
Henry Kautz and Bart Selman (1992). Planning as Satisfiability. Proc. ECAI-92.
Kautz, H. and Selman, B. (1996). Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. Proc. AAAI-96.
Henry Kautz and Bart Selman (1998). The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. ( Figures.) Proc. AIPS-98, Pittsburgh, PA.
Henry Kautz and Bart Selman (1998). BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving. Working notes of the Workshop on Planning as Combinatorial Search, held in conjunction with AIPS-98, Pittsburgh, PA, 1998.
Drew McDermott and the AIPS-98 Planning Competition Committee.  PDDL - The Planning Domain Definition Language, Draft 1.6, June 1998.