508 citations · 562 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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…
cs.AI2025
A Formalism for Optimal Search with Dynamic Heuristics (Extended Version)
Remo Christen, Florian Pommerening, Clemens Büchner +1
While most heuristics studied in heuristic search depend only on the state, some accumulate information during search and thus also depend on the search history. Various existing a…