An analysis of Clone, a weighted Max-SAT solver from the same UCLA group, whose bounds come from compiling the formula so that the search runs in a reduced space.
Clone is a solver for weighted Max-SAT, the problem of satisfying as much of a weighted logical formula as possible. It computes its bounds by compiling the formula, which lets it search a much smaller space. The paper analyses Clone's results in the 2007 Max-SAT evaluation, tests which techniques from the SAT and Max-SAT literature help it, and identifies two properties of weighted Max-SAT problems that set their difficulty for the leading solvers.
It is the compile-once idea applied to optimisation rather than probability, from the same group in the same years. It sits at the edge of this record and is listed for completeness.
A solver study, not a diagnostics result, and not part of PiLogic's product.