Jörg-Uwe Kietz (1993): Some Lower Bounds for the Computational Complexity of Inductive Logic Programming


Title: Some Lower Bounds for the Computational Complexity of Inductive Logic Programming
Author(s): Jörg-Uwe Kietz
Year: 1993
Booktitle: Proceedings of the Sixth European Conference on Machine Learning {ECML}-93
Editor(s): Pavel Brazdil
Pages: 115-123
Publisher: Springer
Address: Berlin, Heidelberg, New York

Concepts