Finding Lower Bound, MineLB

– Example: An upper bound rule with antecedent A=abcde and two rows (r1 : abcf ) and (r2 : cdeg) – Initialize lower bounds {a, b, c, d, e} – add “abcf”--- new lower {d ,e} – Add “cdeg”--- new lower  bound{ad, bd, ae, be}

a,b,c,d,e

ad

ae

bd

be

abc

cde

a

e

b

c

d

Candidate lower bound: ad, ae, bd, be Kept since no lower bound override them