Interactive theorem provers (ITPs) are computer programs in which axioms and a conjecture
are stated in a formal language, and a user provides the ITP with relatively high-level steps …

We formally verify executable algorithms for solving Markov decision processes (MDPs) in
the interactive theorem prover Isabelle/HOL. We build on existing formalizations of …

We present a simple and concise semantics for temporal planning. Our semantics are
developed and formalised in the logic of the interactive theorem prover Isabelle/HOL. We …

Planning languages have been used successfully in AI for several decades. Recent trends
in AI verification and Explainable AI have raised the question of whether AI planning …

In an attempt to handle some of the challenges of modern production, intelligent automation
systems offer solutions that are flexible, adaptive, and collaborative. Contrary to traditional …

We formally verify executable algorithms for solving Markov decision processes (MDPs) in
the interactive theorem prover Isabelle/HOL. We build on existing formalizations of …

Historically, the Artificial Intelligence and programming language fields have had a mutually
beneficial relationship. Typically, theoretical results in the programming language field have …

The development of efficient propositional satisfiability problem solving algorithms (SAT
solvers) in the past two decades has made automated planning using SAT-solvers an …