We describe a formal correctness proof of RANKING, an online algorithm f...
We formally verify executable algorithms for solving Markov decision
pro...
We present a simple and concise semantics for temporal planning. Our
sem...
We investigate upper bounds on the length of cost optimal plans that are...
We present an executable formally verified SAT encoding of classical AI
...
We devise a method to exactly compute the length of the longest simple p...
The goal of the LEDA project was to build an easy-to-use and extendable
...