The first step of our algorithm takes advantage of graph sparsity: Most predicates in language do not entail one another.
it might be possible to decompose entailment graphs into small components and solve each component separately.