Let L be the set of literals occurring in φ. We add a constraint Ψ encoding theory-consistency of the implicant as follows: Ψ = (Bφ(l) ⇒ l) l∈L Note that in particular, this constraint guarantees that any satisfying assignment is consistent. Moreover, it guarantees that the ...
the data may be validated. The data may be validated by checking the ranges and cross-checking various values within the bit rate allocation chart for consistency. If inconsistent terms are entered, then the data will not be considered valid. In step1218, if the data is not valid, step1220...