Specifically, for the rule p ∈ +c ∧ Form(p, +f), all instances given a fixed c form a group; for each of the remaining three rules, all instances given a fixed a form a group.
notice that with these constraints the completion likelihood P (Q, L) can be computed in closed form for any L. each formula group contributes a term equal to the weight of the currently satisfied formula.