Bibliography

1

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

2

H. Aït-Kaci.
Warren's Abstract Machine: A Tutorial Reconstruction.
The MIT Press, Cambridge, Massachusetts, 1991.

http://www.isg.sfu.ca/~hak/documents/wam.html.

3

H. Blockeel.
Top-down induction of first order logical decision trees.
PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, 1998.

http://www.cs.kuleuven.ac.be/~ml/PS/blockeel98:phd.ps.gz.

4

H. Blockeel and L. De Raedt.
Lookahead and discretization in ILP.
In Proceedings of the Seventh International Workshop on Inductive Logic Programming, volume 1297 of Lecture Notes in Artificial Intelligence, pages 77-85. Springer-Verlag, 1997.

5

H. Blockeel and L. De Raedt.
Top-down induction of first order logical decision trees.
Artificial Intelligence, 101(1-2):285-297, June 1998.

6

H. Blockeel, L. De Raedt, N. Jacobs, and B. Demoen.
Scaling up inductive logic programming by learning from interpretations.
Data Mining and Knowledge Discovery, 3(1):59-93, 1999.

7

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

8

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

9

M. Bongard.
Pattern Recognition.
Spartan Books, 1970.

10

I. Bratko.
Prolog Programming for Artificial Intelligence.
Addison-Wesley, Wokingham, England, 1990.
2nd Edition.

11

L. Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone.
Classification and Regression Trees.
Wadsworth, Belmont, 1984.

12

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

13

P. Clark and T. Niblett.
The CN2 algorithm.
Machine Learning, 3(4):261-284, 1989.

14

L. De Raedt.
Logical settings for concept learning.
Artificial Intelligence, 95:187-201, 1997.

15

L. De Raedt and L. Dehaspe.
Clausal discovery.
Machine Learning, 26:99-146, 1997.

16

L. De Raedt and S. Dzeroski.
First order $jk$-clausal theories are PAC-learnable.
Artificial Intelligence, 70:375-392, 1994.

17

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

18

L. Dehaspe and H. Toivonen.
Discovery of frequent datalog patterns.
Data Mining and Knowledge Discovery, 3(1):7-36, 1999.

19

S. Dekeyser and J. Paredaens.
Query pack trees for multi query optimization.
Technical Report 01-04, University of Antwerp, May 2001.
ftp://wins.uia.ac.be/pub/dekeyser/qpt.ps.

20

B. Demoen, G. Janssens, and H. Vandecasteele.
Executing query flocks for ILP.
In Sandro Etalle, editor, Proceedings of the Eleventh Benelux Workshop on Logic Programming, pages 1-14, Maastricht, The Netherlands, November 1999.
14 pages.

21

Stefan Kramer.
Structural regression trees.
In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 812-819, Cambridge/Menlo Park, 1996. AAAI Press/MIT Press.

22

M. Mehta, R. Agrawal, and J. Rissanen.
SLIQ: A fast scalable classifier for data mining.
In Proceedings of the Fifth International Conference on Extending Database Technology, 1996.

23

S. Muggleton.
Inverse entailment and Progol.
New Generation Computing, Special issue on Inductive Logic Programming, 13(3-4):245-286, 1995.

24

S. Muggleton and L. De Raedt.
Inductive logic programming : Theory and methods.
Journal of Logic Programming, 19,20:629-679, 1994.

25

J. R. Quinlan.
C4.5: Programs for Machine Learning.
Morgan Kaufmann series in machine learning. Morgan Kaufmann, 1993.

26

J.R. Quinlan.
FOIL: A midterm report.
In P. Brazdil, editor, Proceedings of the 6th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1993.

27

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

28

M. Sebag and C. Rouveirol.
Tractable Induction and Classification in First-Order Logic via Stochastic Matching.
In Proceedings of the 15th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1997.

29

T. Sellis.
Multiple-query optimization.
ACM Transactions on Database Systems, 13(1):23-52, 1988.

30

A. Srinivasan.
A study of two sampling methods for analysing large datasets with ILP.
Data Mining and Knowledge Discovery, 3(1):95-123, 1999.

31

A. Srinivasan.
A study of two probabilistic methods for searching large spaces with ILP.
Technical Report PRG-TR-16-00, Oxford University Computing Laboratory, 2000.

32

A. Srinivasan, S.H. Muggleton, and R.D. King.
Comparing the use of background knowledge by inductive logic programming systems.
In L. De Raedt, editor, Proceedings of the Fifth International Workshop on Inductive Logic Programming, 1995.

33

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