2 citations · 6 across the 3 of their papers we have counts for
4 papers
Formal Semantics and Formally Verified Validation for Temporal Planning
Mohammad Abdulaziz, Lukas Koller
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 derive f…
Cost Optimal Planning as Satisfiability
Mohammad Abdulaziz
We investigate upper bounds on the length of cost optimal plans that are valid for problems with 0-cost actions. We employ these upper bounds as horizons for a SAT-based encoding o…
Computing Plan-Length Bounds Using Lengths of Longest Paths
Mohammad Abdulaziz, Dominik Berger
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. Although the complexity o…
Trustworthy Graph Algorithms
Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on th…