2 papers
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.AI2024
Certified MaxSAT Preprocessing
Hannes Ihalainen, Andy Oertel, Yong Kiam Tan +3
Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimizatio…