2025/10/11 by David Wang, Wang, David, Mohammad Abdulaziz +1
Computer Science · #Formal Methods in Verification #AI-based Problem Solving and Planning #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.48550/arxiv.2510.10189
We present an approach to unsolvability certification of temporal planning. Our approach is based on encoding the planning problem into a network of timed automata, and then using an efficient model checker on the network followed by a certificate checker to certify the output of the model checker. Our approach prioritises trustworthiness of the certification: we formally verify our implementation of the encoding to timed automata using the theorem prover Isabelle/HOL and we use an existing certificate checker (also formally verified in Isabelle/HOL) to certify the model checking result.