We address a dynamic decision problem in which decision makers must pay some costs when they change their decisions along the way We formalize this problem as Dynamic SAT (DynSAT) with decision change costs  whose goal is to find a sequence of models that minimize the aggregation of the costs for changing variables