Seol mar théacs é seo: On the Complexity of Some Inductive Logic Programming Problems