Bounded Least General Generalization

  • Ondřej Kuželka
  • Andrea Szabóová
  • Filip Železný
Conference paper

DOI: 10.1007/978-3-642-38812-5_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7842)
Cite this paper as:
Kuželka O., Szabóová A., Železný F. (2013) Bounded Least General Generalization. In: Riguzzi F., Železný F. (eds) Inductive Logic Programming. ILP 2012. Lecture Notes in Computer Science, vol 7842. Springer, Berlin, Heidelberg

Abstract

We study a generalization of Plotkin’s least general generalization. We introduce a novel concept called bounded least general generalization w.r.t. a set of clauses and show an instance of it for which polynomial-time reduction procedures exist. We demonstrate the practical utility of our approach in experiments on several relational learning datasets.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ondřej Kuželka
    • 1
  • Andrea Szabóová
    • 1
  • Filip Železný
    • 1
  1. 1.Faculty of Electrical EngineeringCzech Technical University in PraguePragueCzech Republic

Personalised recommendations