Horn formula minimization - RIT Scholar Works
... Given two Boolean functions f and g, if for every possible truth assignment,
f (p1 , . . . , pn ) = true implies g(p1 , . . . , pn ) = true, then we denote this relationship by f → g, meaning f implies g. Likewise, for two clauses C and C ,
we say that C → C if C implies C . For example, given ...