ILP: A short look back and a longer look forward

Journal of Machine Learning Research

Volumn 4, Issue 4, 2004, Pages 415-430

  Page, David ^a   Srinivasan, Ashwin ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATABASE SYSTEMS; DNA; LEARNING SYSTEMS; MULTIMEDIA SYSTEMS; PROBABILITY;

BAYES NET LEARNING SYSTEMS; COMPUTATIONAL LOGIC; INDUCTIVE LOGIC PROGRAMMING (ILP); MULTIMEDIA DATABASES;

LOGIC PROGRAMMING;

EID: 2542450091     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244304773936009     Document Type: Conference Paper

References (46)

1. D. Becker, T. Sterling, D. Savarese, E. Dorband, U. Ranawake, and C. Packer. Beowulf: A parallel workstation for scientific computation. In Proceedings of the 1995 International Conference on Parallel Processing (ICPP), pages 11-14, 1995.
2. M. Botta, A. Giordana, L. Saitta, and M. Sebag. Relational learning as search in a critical region. Journal of Machine Learning Research, 4:431-463, 2003. In this issue.
3. C. Bryant, S. Muggleton, S. Oliver, D Kell, P. Reiser, and R. King. Combining inductive logic programming, active learning and robotics to discover the function of genes. Electronic Transactions in Artificial Intelligence, 5-B1(012):1-36, 2001.
4. M. Craven and J. Kumlien. Constructing biological knowledge bases by extracting information from text sources. In Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, pages 77-86, Heidelberg, Germany, 1999. AAAI Press.
5. M. Craven and S. Slattery. Combining statistical and relational methods for learning in hypertext domains. In Proceedings of the Eighth International Conference on Inductive Logic Programming (ILP-98), pages 38-52. Springer Verlag, 1998.
6. J. Cussens. Loglinear models for first-order probabilistic reasoning. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pages 126-133. Stockholm, Sweden, 1999.
7. S. Džeroski and N. Lavrač. An introduction to inductive logic programming. In S. Džeroski and N. Lavrač, editors, Relational Data Mining, pages 48-71. Springer, Berlin, 2001.
8. S. Džeroski. Inductive logic programming and knowledge discovery in databases. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining. 1996.
9. P. Finn, S. Muggleton, D. Page, and A. Srinivasan. Discovery of pharmacophores using Inductive Logic Programming. Machine Learning, 30:241-270, 1998.
10. A. M. Frisch and C. D. Page. Building theories into instantiation. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1210-1216, 1995.
11. L. Getoor, N. Friedman, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In S. Dzeroski and N. Lavrac, editors, Relational Data Mining, chapter 13, pages 307-335. Springer, Berlin, 2001.
12. A. Giordana, L. Saitta, M. Sebag, and M. Botta. Analyzing relational learning in the phase transition framework. In P. Langley, editor, Proceedings of the Seventeenth International Conference on Machine Learning, pages 311-318, Stanford, 2000. Morgan Kaufmann.
13. C. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24:67-100, 2000.
14. G. Gottlob. Subsumption and implication. Information Processing Letters, 24(2): 109-111, 1987.
15. D. Heckerman. A tutorial on learning with Bayesian networks. Microsoft Technical Report MSR-TR-95-06, 1995.
16. D. Heckerman, E. Horvitz, and B. Nathwani. Toward normative expert systems, Part I: The pathfinder project. Methods of Information in Medicine, 31:90-105, 1992.
17. D. Hilbert. Mathematical problems. Bulletin of the American Mathematical Society, 8:437-479, 1902. English translation of original German, provided by Mary Winston.
18. A. H. Kamal, J. Graham, and C.D. Page. An approach to parallel data mining for pharmacophore discovery. In Proceedings of the Tenth International Conference on Intelligent Systems, pages 100-103, Washington, D.C., June 2001.
19. K. Kersting and L. De Raedt. Towards combining inductive logic programming and Bayesian networks. In Proceedings of the Eleventh International Conference on Inductive Logic Programming, pages 118-137. Berlin: Springer LNAI 2157, 2001.
20. K. Kersting, L. De Raedt, and S. Kramer. Interpreting Bayesian logic programs. In L. Getoor and D. Jensen, editors, Proceedings of the AAAI-2000 Workshop on Learning Statistical Models from Relational Data, Austin, Texas, 2000. AAAI Press, Technical Report WS-00-06.
21. R. King, S. Muggleton, A. Srinivasan, and M. Sternberg. Structure-activity relationships derived by machine learning: The use of atoms and their bond connectives to predict mutagenicity by inductive logic programming. Proceedings of the National Academy of Sciences, 93:438-442, 1996.
22. C. Lee. A completeness theorem and a computer program for finding theorems derivable from given axioms. PhD thesis, University of California, Berkeley, 1967.
23. T. Leung, M. Burl, and P. Perona. Probabilistic affine invariants for recognition. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, 1998.
24. T. Leung and J. Malik. Representing and recognizing the visual appearance of materials using three-dimensional textons. International Journal of Computer Vision, 43(1):29-44, 2001.
25. M. Litzkow, M. Livny, and M. Mutka. Condor - a hunter of idle workstations. In Proceedings of the International Conference on Distributed Computing Systems, pages 104-111, 1988.
26. N. Marchand-Geneste, K. Watson, B. Alsberg, and R. King. A new approach to pharmacophore mapping and QSAR analysis using inductive logic programming. Application to thermolysin inhibitors and glycogen phosphorylase b inhibitors. Journal of Medicinal Chemistry, 45(2):399-409, January 2002.
27. J. Marcinkowski and L. Pacholski. Undecidability of the Horn-clause implication problem. In Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science, pages 354-362. IEEE, 1992.
28. T.M. Mitchell. The need for biases in learning generalizations. Technical Report CBM-TR-117, Department of Computer Science, Rutgers University, 1980.
29. T.M. Mitchell. Generalisation as search. Artificial Intelligence, 18:203-226, 1982.
30. S. Muggleton. Predicate invention and utilization. Journal of Experimental and Theoretical Artificial Intelligence, 6(1):127-130, 1994.
31. S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245-286, 1995.
32. S. Muggleton. Learning stochastic logic programs. In Proceedings of the AAAI 2000 Workshop on Learning Statistical Models from Relational Data. AAAI, 2000.
33. S. Muggleton and W. Buntine. Machine invention of first-order predicates by inverting resolution. In Proceedings of the Fifth International Conference on Machine Learning, pages 339-352. Kaufmann, 1988.
34. S. Muggleton, R. King, and M. Sternberg. Protein secondary structure prediction using logic-based machine learning. Protein Engineering, 5(7):647-657, 1992.
35. L. Ngo and P. Haddawy, Probabilistic logic programming and Bayesian networks. Algorithms, Concurrency, and Knowledge: LNCS 1023, pages 286-300, 1995.
36. L. Ngo and P. Haddawy. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171:147-177, 1997.
37. M. Sebag and C. Rouveirol. Tractable induction and classification in FOL. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 888-892. Nagoya, Japan, 1997.
38. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence. AAAI Press, 1994.
39. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440-446. AAAI Press, 1992.
40. D. Skillicorn and Y. Wang. Parallel and sequential algorithms for data mining using inductive logic. Knowledge and Information Systems, 3(4):405-421, 2001.
41. A. Srinivasan and R.C. Camacho. Numerical reasoning with an ILP system capable of lazy evaluation and customised search. Journal of Logic Programming, 40:185-214, 1999.
42. A. Srinivasan, S. Muggleton, R. King, and M. Sternberg. Theories for mutagenicity: A study of first-order and feature based induction. Artificial Intelligence, 85(1,2):277-299, 1996.
43. M. Turcotte, S. Muggleton, and M. Sternberg. Application of inductive logic programming to discover rules governing the three-dimensional topology of protein structures. In Proceedings of the Eighth International Conference on Inductive Logic Programming (ILP-98), pages 53-64. Springer Verlag, 1998.
44. R. Wirth and P. O'Rorke. Constraints on predicate invention. In Proceedings of the 8th International Workshop on Machine Learning, pages 457-461. Kaufmann, 1991.
45. F. Zelezny, A. Srinivasan, and D. Page. Lattice-search runtime distributions may be heavy-tailed. In S. Matwin, editor, Proceedings of the Twelfth International Conference on Inductive Logic Programming. Springer-Verlag, 2002.
46. J. Zelle and R. Mooney. Learning semantic grammars with constructive inductive logic programming. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 817-822, San Mateo, CA, 1993. Morgan Kaufmann.