Implementation of Critical Path Heuristics for SAT
Huang Jinbo · Frontiers in artificial intelligence and applications · 2012
Recent 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 hmaxheuristic has been shown to be implemented trivially by the empty set of clauses. This paper presents an implementation of hm, a generalization of hmax.