Huang, Jinbo2026-01-012026-01-0197816149909700922-6389https://hdl.handle.net/1885/733799079Recent work has shown that SAT can be theoretically more powerful than heuristic search provided the heuristic used by search is implemented as a set of clauses on which unit propagation simulates the evaluation of the heuristic. The hmax heuristic has been shown to be implemented trivially by the empty set of clauses. This paper presents an implementation of hm, a generalization of hmax.2en201210.3233/978-1-61499-098-7-90784878803348