A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment

  • Héctor Corrada Bravo
  • David Page
  • Raghu Ramakrishnan
  • Jude Shavlik
  • Vitor Santos Costa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3625)


We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computation, is more amenable to the use of set-oriented generation and evaluation of hypotheses, and allows relational DBMS technology to be more easily applied to ILP systems. Further, our approach opens up new avenues such as probabilistically scoring rules during search and the generation of probabilistic rules. As a first example of the benefits of our ILP framework, we propose a scheme for defining the hypothesis search space through Inverse Entailment using multiple example seeds.


Logic Program Single Seed Inductive Logic Programming Horn Clause Hypothesis Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dzeroski, S., Lavrac, N. (eds.): Relational Data Mining. Springer, New York (2001)zbMATHGoogle Scholar
  2. 2.
    Blockeel, H., Sebag, M.: Scalability and efficiency in multi-relational data mining. SIGKDD Explor. Newsl. 5, 17–30 (2003)CrossRefGoogle Scholar
  3. 3.
    Struyf, J., Blockeel, H.: Query optimization in inductive logic programming by reordering literals. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 329–346. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Bockhorst, J., Ong, I.M.: FOIL-D: Efficiently scaling FOIL for multi-relational data mining of large datasets. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 63–79. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the efficiency of inductive logic programming through the use of query packs. J. Artif. Intell. Res. (JAIR) 16, 135–166 (2002)zbMATHGoogle Scholar
  6. 6.
    Costa, V.S., Srinivasan, A., Camacho, R., Blockeel, H., Demoen, B., Janssens, G., Struyf, J., Vandecasteele, H., Laer, W.V.: Query transformations for improving the efficiency of ILP systems. Journal of Machine Learning Research 4, 465–491 (2003)CrossRefGoogle Scholar
  7. 7.
    Cussens, J.: Using prior probabilities and density estimation for relational classification. In: Page, D.L. (ed.) ILP 1998. LNCS, vol. 1446, pp. 106–115. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  8. 8.
    Zelezný, F., Srinivasan, A., Page, D.: A Monte Carlo study of randomised restarted search in ILP. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 341–358. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    DiMaio, F., Shavlik, J.W.: Learning an approximation to inductive logic programming clause evaluation. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 80–97. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Vens, C., Assche, A.V., Blockeel, H., Dzeroski, S.: First order random forests with complex aggregates. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 323–340. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Costa, V.S., Page, D., Qazi, M., Cussens, J.: CLP(BN): Constraint logic programming for probabilistic knowledge. In: International Conference on Uncertainty in Artificial Intelligence (2003)Google Scholar
  12. 12.
    Srivasanan, A.: The Aleph manual. Source code (2004), available at
  13. 13.
    Muggleton, S.: Inverse entailment and Progol. New Generation Comput. 13, 245–286 (1998)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Ramakrishnan, R., Gehrke, J.: Database Management Systems, 3rd edn. McGraw-Hill, New York (2003)zbMATHGoogle Scholar
  15. 15.
    Ferilli, S., Mauro, N.D., Basile, T.M.A., Esposito, F.: Theta-subsumption and resolution: A new algorithm. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 384–391. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  16. 16.
    Mauro, N.D., Basile, T.M.A., Ferilli, S., Esposito, F., Fanizzi, N.: An exhaustive matching procedure for the improvement of learning efficiency. In: [24], pp. 112–129Google Scholar
  17. 17.
    Maloberti, J., Sebag, M.: Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning 55, 137–174 (2004)zbMATHCrossRefGoogle Scholar
  18. 18.
    Arias, M., Khardon, R.: Bottom-up ilp using large refinement steps. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 26–43. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  19. 19.
    Fonseca, N., Rocha, R., Camacho, R., Silva, F.M.A.: Efficient data structures for inductive logic programming. In: [24] pp.130–145Google Scholar
  20. 20.
    Yin, X., Han, J., Yang, J., Yu, P.S.: Crossmine: Efficient classification across multiple database relations. In: ICDE, pp. 399–411. IEEE Computer Society, Los Alamitos (2004)Google Scholar
  21. 21.
    Ramakrishnan, R., Srivastava, S., Sudarshan, S.: Efficient bottom-up evaluation of logic programs. In: Dewilde, P., Vandewalle, J. (eds.) Computer Systems and Software Engineering: State-Of-The-Art. Kluwer Academic Publishers, Dordrecht (1992)Google Scholar
  22. 22.
    Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)Google Scholar
  23. 23.
    Dehaspe, L., Toivonen, H.: Discovery of frequent datalog patterns. Data Min. Knowl. Discov. 3, 7–36 (1999)CrossRefGoogle Scholar
  24. 24.
    Horváth, T., Yamamoto, A. (eds.): ILP 2003. LNCS (LNAI), vol. 2835. Springer, Heidelberg (2003)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Héctor Corrada Bravo
    • 1
  • David Page
    • 1
    • 2
  • Raghu Ramakrishnan
    • 1
  • Jude Shavlik
    • 1
    • 2
  • Vitor Santos Costa
    • 2
    • 3
  1. 1.Department of Computer Sciences 
  2. 2.Department of Biostatistics and Medical InformaticsUniversity of Wisconsin-MadisonUSA
  3. 3.COPPE/Sistemas UFRJBrasil

Personalised recommendations