Alpha
Alpha copied to clipboard
Revise domain-independent heuristics
A while ago, a set of domain-independent branching heuristics (BerkMin
, DependencyDrivenHeuristic
, and their subclasses) has been developed. In contrast to the newly developed VSIDS
, their runtime performance is not very good and must be improved. Also, some design decisions might have to be revised (e.g., do we need both methods violatedNoGood
and analyzedConflict
)?