Bounded Least General Generalization
- 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
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.
Unable to display preview. Download preview PDF.