3 citations · 10 across the 12 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.AI2020
Formally Verified SAT-Based AI Planning
Mohammad Abdulaziz, Friedrich Kurz
We present an executable formally verified SAT encoding of classical AI planning. We use the theorem prover Isabelle/HOL to perform the verification. We experimentally test the ver…
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…