\begin{thebibliography}{10}

\bibitem{Agrawal96:coll}
R.~Agrawal, H.~Mannila, R.~Srikant, H.~Toivonen, and A.I. Verkamo.
\newblock Fast discovery of association rules.
\newblock In U.~Fayyad, G.~Piatetsky-Shapiro, P.~Smyth, and R.~Uthurusamy,
  editors, {\em Advances in Knowledge Discovery and Data Mining}, pages
  307--328. The MIT Press, 1996.

\bibitem{Ait-Kaci91:other}
H.~A{\"\i}t-Kaci.
\newblock {\em Warren's Abstract Machine: A Tutorial Reconstruction}.
\newblock The MIT Press, Cambridge, Massachusetts, 1991.
\newblock \\{\tt http://www.isg.sfu.ca/\verb|~|hak/documents/wam.html}.

\bibitem{Blockeel98:other}
H.~Blockeel.
\newblock {\em Top-down induction of first order logical decision trees}.
\newblock PhD thesis, Department of Computer Science, Katholieke Universiteit
  Leuven, 1998.
\newblock \\{\tt http://www.cs.kuleuven.ac.be/\~{}ml/PS/blockeel98:phd.ps.gz}.

\bibitem{Blockeel97:proc}
H.~Blockeel and L.~De~Raedt.
\newblock Lookahead and discretization in {ILP}.
\newblock In {\em Proceedings of the Seventh International Workshop on
  Inductive Logic Programming}, volume 1297 of {\em Lecture Notes in Artificial
  Intelligence}, pages 77--85. Springer-Verlag, 1997.

\bibitem{Blockeel98b:jrnl}
H.~Blockeel and L.~De~Raedt.
\newblock Top-down induction of first order logical decision trees.
\newblock {\em Artificial Intelligence}, 101(1-2):285--297, June 1998.

\bibitem{Blockeel99:jrnl}
H.~Blockeel, L.~De~Raedt, N.~Jacobs, and B.~Demoen.
\newblock Scaling up inductive logic programming by learning from
  interpretations.
\newblock {\em Data Mining and Knowledge Discovery}, 3(1):59--93, 1999.

\bibitem{Blockeel98:proc}
H.~Blockeel, L.~De~Raedt, and J.~Ramon.
\newblock Top-down induction of clustering trees.
\newblock In {\em Proceedings of the 15th International Conference on Machine
  Learning}, pages 55--63, 1998.
\newblock {\tt http:}\-{\tt //www.}\-{\tt cs.}\-{\tt kuleuven.}\-{\tt
  ac.}\-{\tt be/\~{}ml/}\-{\tt PS/}\-{\tt ML98-56.ps}.

\bibitem{Blockeel00-WIP:proc}
H.~Blockeel, B.~Demoen, G.~Janssens, H.~Vandecasteele, and W.~Van~Laer.
\newblock Two advanced transformations for improving the efficiency of an {ILP}
  system.
\newblock In {\em 10th International Conference on Inductive Logic Programming,
  Work-in-Progress Reports}, pages 43--59, London, UK, July 2000.

\bibitem{Bongard70:book}
M.~Bongard.
\newblock {\em Pattern Recognition}.
\newblock Spartan Books, 1970.

\bibitem{Bratko90:other}
I.~Bratko.
\newblock {\em Prolog Programming for Artificial Intelligence}.
\newblock Addison-Wesley, Wokingham, England, 1990.
\newblock 2nd Edition.

\bibitem{Breiman84:other}
L.~Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone.
\newblock {\em Classification and Regression Trees}.
\newblock Wadsworth, Belmont, 1984.

\bibitem{Chen96:jrnl}
W.~Chen and D.~S. Warren.
\newblock Tabled evaluation with delaying for general logic programs.
\newblock {\em Journal of the ACM}, 43(1):20--74, January 1996.
\newblock {{\tt http://www.cs.sunysb.edu/\~{}sbprolog}}.

\bibitem{Clark89:jrnl}
P.~Clark and T.~Niblett.
\newblock The {CN2} algorithm.
\newblock {\em Machine Learning}, 3(4):261--284, 1989.

\bibitem{Deraedt97-AI:jrnl}
L.~De~Raedt.
\newblock Logical settings for concept learning.
\newblock {\em Artificial Intelligence}, 95:187--201, 1997.

\bibitem{DeRaedt97-ML:jrnl}
L.~De~Raedt and L.~Dehaspe.
\newblock Clausal discovery.
\newblock {\em Machine Learning}, 26:99--146, 1997.

\bibitem{DeRaedt94-AI:jrnl}
L.~De~Raedt and S.~D\v{z}eroski.
\newblock First order $jk$-clausal theories are {PAC}-learnable.
\newblock {\em Artificial Intelligence}, 70:375--392, 1994.

\bibitem{DeRaedt95-ALT:proc}
L.~De~Raedt and W.~Van~Laer.
\newblock Inductive constraint logic.
\newblock In Klaus~P. Jantke, Takeshi Shinohara, and Thomas Zeugmann, editors,
  {\em Proceedings of the Sixth International Workshop on Algorithmic Learning
  Theory}, volume 997 of {\em Lecture Notes in Artificial Intelligence}, pages
  80--94. Springer-Verlag, 1995.

\bibitem{Dehaspe99:jrnl}
L.~Dehaspe and H.~Toivonen.
\newblock Discovery of frequent datalog patterns.
\newblock {\em Data Mining and Knowledge Discovery}, 3(1):7--36, 1999.

\bibitem{Dekeyser01:other}
S.~Dekeyser and J.~Paredaens.
\newblock Query pack trees for multi query optimization.
\newblock Technical Report 01-04, University of Antwerp, May 2001.
\newblock {\tt ftp://wins.uia.ac.be/pub/dekeyser/qpt.ps}.

\bibitem{Demoen99:proc}
B.~Demoen, G.~Janssens, and H.~Vandecasteele.
\newblock Executing {q}uery {f}locks for {ILP}.
\newblock In Sandro Etalle, editor, {\em Proceedings of the Eleventh Benelux
  Workshop on Logic Programming}, pages 1--14, Maastricht, The Netherlands,
  November 1999.
\newblock 14 pages.

\bibitem{Kramer96:proc}
Stefan Kramer.
\newblock Structural regression trees.
\newblock In {\em Proceedings of the Thirteenth National Conference on
  Artificial Intelligence}, pages 812--819, Cambridge/Menlo Park, 1996. AAAI
  Press/MIT Press.

\bibitem{Mehta96:proc}
M.~Mehta, R.~Agrawal, and J.~Rissanen.
\newblock {SLIQ}: A fast scalable classifier for data mining.
\newblock In {\em Proceedings of the Fifth International Conference on
  Extending Database Technology}, 1996.

\bibitem{Muggleton95-NGC:jrnl}
S.~Muggleton.
\newblock Inverse entailment and {Progol}.
\newblock {\em New Generation Computing, Special issue on Inductive Logic
  Programming}, 13(3-4):245--286, 1995.

\bibitem{Muggleton94-JLP:jrnl}
S.~Muggleton and L.~De~Raedt.
\newblock Inductive logic programming : Theory and methods.
\newblock {\em Journal of Logic Programming}, 19,20:629--679, 1994.

\bibitem{Quinlan93:other}
J.~R. Quinlan.
\newblock {\em C4.5: Programs for Machine Learning}.
\newblock Morgan Kaufmann series in machine learning. Morgan Kaufmann, 1993.

\bibitem{Quinlan93:proc}
J.R. Quinlan.
\newblock {FOIL}: A midterm report.
\newblock In P.~Brazdil, editor, {\em Proceedings of the 6th European
  Conference on Machine Learning}, Lecture Notes in Artificial Intelligence.
  Springer-Verlag, 1993.

\bibitem{SantosCosta00:proc}
V.~Santos~Costa, A.~Srinivasan, and R.~Camacho.
\newblock A note on two simple transformations for improving the efficiency of
  an {ILP} system.
\newblock In {\em Proceedings of the Tenth International Conference on
  Inductive Logic Programming}, volume 1866 of {\em Lecture Notes in Artificial
  Intelligence}, pages 225--242. Springer-Verlag, 2000.

\bibitem{Sebag97-IJCAI:proc}
M.~Sebag and C.~Rouveirol.
\newblock {T}ractable {I}nduction and {C}lassification in {F}irst-{O}rder
  {L}ogic via {S}tochastic {M}atching.
\newblock In {\em Proceedings of the 15th International Joint Conference on
  Artificial Intelligence}. Morgan Kaufmann, 1997.

\bibitem{Sellis88:jrnl}
T.~Sellis.
\newblock Multiple-query optimization.
\newblock {\em ACM Transactions on Database Systems}, 13(1):23--52, 1988.

\bibitem{Srinivasan99:jrnl}
A.~Srinivasan.
\newblock A study of two sampling methods for analysing large datasets with
  {ILP}.
\newblock {\em Data Mining and Knowledge Discovery}, 3(1):95--123, 1999.

\bibitem{Srinivasan00-prob:other}
A.~Srinivasan.
\newblock A study of two probabilistic methods for searching large spaces with
  {ILP}.
\newblock Technical Report PRG-TR-16-00, Oxford University Computing
  Laboratory, 2000.

\bibitem{Srinivasan95:proc}
A.~Srinivasan, S.H. Muggleton, and R.D. King.
\newblock Comparing the use of background knowledge by inductive logic
  programming systems.
\newblock In L.~De~Raedt, editor, {\em Proceedings of the Fifth International
  Workshop on Inductive Logic Programming}, 1995.

\bibitem{Tsur98-SIGMOD:proc}
D.~Tsur, J.D. Ullman, S.~Abiteboul, C.~Clifton, R.~Motwani, S.~Nestorov, and
  A.~Rosenthal.
\newblock Query flocks: {A} generalization of association-rule mining.
\newblock In {\em Proceedings of the {ACM} {SIGMOD} International Conference on
  Management of Data ({SIGMOD}-98)}, volume 27,2 of {\em ACM SIGMOD Record},
  pages 1--12, New York, June~1--4 1998. ACM Press.

\end{thebibliography}
