To overcome this, we take advantage of graph sparsity: most predicates in language do not entail one another.
it might be possible to decompose graphs into small components and solve each Algorithm 1 Decomposed-ILP Input: A set V and a function f component separately.