A Characteristic Set Method for Solving Boolean Equations
A Characteristic Set Method for Solving Boolean Equations
A Characteristic Set Method for Solving Boolean Equations
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Background CS <strong>Method</strong> Implementation Experiment Conclusion<br />
Well-Ordering Principle<br />
Let P0 be a finite <strong>Boolean</strong> polynomial set.<br />
P = P0 P1 · · · Pi · · · Pm<br />
C0 C1 · · · Ci · · · Cm = C<br />
R0 R1 · · · Ri · · · Rm = ∅<br />
Ci = a characteristic set of Pi<br />
Ri = prem(Pi, Ci)<br />
Pi+1 = Pi ∪ Ri<br />
Fact. m ≤ 2 n .<br />
Wu <strong>Characteristic</strong> <strong>Set</strong> of P: C<br />
(1) ∀P ∈ P, prem(P, C) = 0.<br />
(2) C ⊂ (P).<br />
Fact: Cm is a Wu CS of P.<br />
(2)
Change language