We require that each parse be identified by a unique value satisfying the no-goods.
we require that: Finally, a packed representation R represents the set of parses Ω(R) that are identified by values that satisfy the no-goods, i.e., Ω(R) = {ω(x)|x ∈ X , N (x) = 1}.