Picat is a new constraint logic programming language that has obtained promising results in international competitions. These re-sults have been achieved thanks to several features. The most effective of them is an efficient handling of a tabling technique applied to search al-gorithms. A compiler from PDDL to Picat, which automatically enables to run PDDL models in Picat, has been recently developed. This paper describes a method which automatically optimizes the output of such a compiler, using a different representation of the states that better takes advantage of Picat’s Tabling technique.