On the Complexity of some Inductive Logic Programming Problems