A Kautz and Bart Selman
SATPLAN is currently one of the fastest planning systems for domain-independent planning. In nearly all practical applications, however, there exists an abundance of domain-specific knowledge that can be used to improve the performance of a planning system. This knowledge is traditionally encoded as procedures or rules that are tied to the details of the planning engine. We present a way to encode domain knowledge is a purely declarative, algorithm independent manner. We demonstrate that the same heuristic knowledge can be used by completely different search engines, one systematic, the other using greedy local search. This approach greatly enhances the power of SATPLAN: solution times for some problems are reduced from days to seconds.