Measuring Per-Decision Propagation Work as a Formula-Dependent Signal
Hardware accelerators for Boolean satisfiability (SAT) target the solver's inner loop, Boolean constraint propagation (BCP), where PR is a trace statistic of little use to a software solver, but under hardware acceleration it determines whether a formula carries enough work per offload to justify sending it at all.