We present an executable formally verified SAT encoding of classical AI planning. We use the theorem prover Isabelle/HOL to perform the verification. We experimentally test the verified encoding and show that it can be used for reasonably sized standard planning benchmarks. We also use it as a reference to test a state-of-the-art SAT-based planner, showing that it sometimes falsely claims that problems have no solutions of certain lengths.

翻译：我们提出了一个可执行的可正式核实的典型AI计划沙特卫星编码。我们使用理论验证师Isabelle/HOL来进行核查。我们实验测试了经核实的编码,并表明它可以用于合理规模的标准规划基准。我们用它作为参考来测试以沙特卫星为基础的最先进的规划师,表明它有时错误地声称问题没有某种长度的解决办法。