Search Results for author:
Found 5 papers, 1 papers with code
Formally Verified Solution Methods for Infinite-Horizon Markov Decision Processes
We formally verify executable algorithms for solving Markov decision processes (MDPs) in the interactive theorem prover Isabelle/HOL.
Formal Semantics and Formally Verified Validation for Temporal Planning
We derive from those semantics a validation algorithm for temporal planning and show, using a formal proof in Isabelle/HOL, that this validation algorithm implements our semantics.
Cost Optimal Planning as Satisfiability
We investigate upper bounds on the length of cost optimal plans that are valid for problems with 0-cost actions.
Formally Verified SAT-Based AI Planning
We present an executable formally verified SAT encoding of classical AI planning.
Computing Plan-Length Bounds Using Lengths of Longest Paths
We devise a method to exactly compute the length of the longest simple path in factored state spaces, like state spaces encountered in classical planning.
