C f is calculated as follows, where N f is the total number of instantiated formula f and N X is the total number of instantiated X. Enumerating paths is a time consuming process and does not apply to large-scale KBs.
random walk on the graph is proposed to collect frequent paths instead of enumerating.