Taming the Complexity of Inductive Logic Programming

  • Authors:
  • Filip Železný;Ondřej Kuželka

  • Affiliations:
  • Faculty of Electrical Engineering, Department of Cybernetics, Czech Technical University in Prague, Prague 6, Czech Republic 16627;Faculty of Electrical Engineering, Department of Cybernetics, Czech Technical University in Prague, Prague 6, Czech Republic 16627

  • Venue:
  • SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inductive logic programming (ILP) [12] is concerned with the induction of theories from specific examples and background knowledge, using first-order logic representations for all the three ingredients. In its early days some twenty years ago, ILP was perceived as a means for automatic synthesis of logic programs, i.e. Horn clausal theories. Current research views ILP algorithms mainly in the context of machine learning [14] and data mining [1]. ILP has enriched both of the two fieds significantly by providing them with formalisms and algorithms for learning (or `mining') complex pieces of knowledge from non-trivially structured data such as relational databases.