F. S. Fanizzi-n and M. N. Basile-t, Efficient thetasubsumption under object identity, Atti del Workshop AI*IA su Apprendimento Automatico, 2002.

G. G. Fermüller-c, Removing redundancy from a clause, Artificial Intelligence, vol.61, issue.2, pp.263-289, 1993.

G. G. Koch-c and . U. Wien-t, Monadic datalog and the expressive power of languages for web information extraction, J. ACM, vol.513, pp.17-28, 2002.

K. Lübbe-m, An efficient subsumption algorithm for inductive logic programming, Proceedings 11th International Conference on Machine Learning, pp.130-138, 1994.

M. J. Sebag-m, Theta-subsumption in a constraint satisfaction perspective, ILP '01 : Proceedings of the 11th International Conference on Inductive Logic Programming, pp.164-178, 2001.

M. S. Feng-c, Efficient induction of logic programs, Proceedings of the 1st Conference on Algorithmic Learning Theory, pp.368-381, 1990.