collaborators

1 paper

cs.AI2025

Pseudo-Boolean Proof Logging for Optimal Classical Planning

Simon Dold, Malte Helmert, Jakob Nordström +2

We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified…