论文标题
正式验证的基于SAT的AI计划
Formally Verified SAT-Based AI Planning
论文作者
论文摘要
我们提出了可执行的经典AI计划的可执行验证的SAT编码。我们使用定理供奉献iSabelle/hol来执行验证。我们通过实验测试经过验证的编码，并证明它可用于合理尺寸的标准计划基准。我们还将其用作测试基于SAT的最先进的计划者的参考，表明它有时会错误地声称问题没有某些时间的解决方案。
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.
