propose Tree-Node-Fix (TNF), an approximation method that scales better by additionally assuming the entailment graphs are "forest reducible," where a predicate cannot entail two (or more) predicates j and k such that neither j→k nor k→j (FRG assumption).
the FRG assumption is not correct for many real-world domains.