Solving AI Planning Problems with SAT
Jussi Rintanen · 2013
I Solving the AI planning problem with SAT algorithms I Novelty: planning earlier viewed as a deduction problem I Idea: I propositional variables for every state variable for every time point I clauses that describe how state can change between two consecutive time points I unit clauses specifying the initial state and goal states I Test material for local search algorithm GSAT [SLM92] I Resulting SAT problems that could be solved had up to 1000 variables and 15000 clauses.