2 citations · 6 across the 3 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2022★ 2 cited
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…
cs.AI2021★ 2 cited
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…
cs.AI2020
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…