On the Path from Classical Planning to Arithmetic Constraint Satisfaction

Contents

We discuss a method to automatically transform a classical planning problem into an arithmetic constraint satisfaction problem (aCSP). This transformation specifies the variables of the aCSP, their ranges and the binary arithmetic constraints over these variables. A bounds consistency solver is then called to build ranges consistent with the arithmetic constraints. The transformation presented in this paper only produces totally ordered plans and propositional classical planning.