Inductive logic programming (ILP)

given
- B background knowledge
- E (E+, E-) positive and negative examples
find
- H = D1 Ù D2 Ù ... Ù Dn
such that
- B Ù E- |° o (prior satisfiability)
- B Ù H Ù E- |° o (posterior satisfiability)
- B |° E+ (prior necessity)
- B Ù H |= E+ (posterior sufficiency)