Systems and Methods for Planning a Solution to a Dynamically Changing Problem

Boolean Satisfiability (SAT) solvers are useful in a variety of problems. SAT problems arise in a number of arenas, the field of planning being an example of an important arena. As the demand for more efficient use of heterogeneous and inter dependent resources has increased, so has the complexity of the constraint problems that must be solved to assign and employ those resources. With the increase in the complexity of the constraint problems that must be solved there have been significant increases in the challenges within the problem of finding feasible plans that make a highly efficient use of the available resources.