Histol · Kautz and selman.1992 Inspired by improvements in satisfiabity algorithms Big Idea Encode planning problem as a(very large) logical formula Initial-state all-possible-actions goal Find a satisfying assignment to action-time propositions, and we have a plan