Fast Estimation of Relational Pattern Coverage through Randomization and Maximum Likelihood

In inductive logic programming, theta-subsumption is a widely used coverage test. Unfortunately, testing theta-subsumption is NP-complete, which represents a crucial efficiency bottleneck for many rel