video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Fast Estimation of Relational Pattern Coverage through Randomization and Maximum Likelihood

Published on 2008-07-283642 Views

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

Related categories