Chapter PDF
References
Adé, Hilde, Luc De Raedt und Maurice Bruynooghe. Declarative Bias for Bottom-up ILP Learning Systems, 1994. To appear in Machine Learning.
Muggleton, S., C. Feng. Efficient Induction of Logic Programs. Proc. of the 1st Conference on Algorithmic Learning Theory, Tokyo, OHMSHA, 1990.
L. De Raedt. Interactive Theory Revision: an Inductive Logic Programming Approach. Academic Press, 1992.
I. Stahl and I. Weber. The Arguments of Newly Invented Predicates in ILP. In Proc. of ILP-94, 1994.
I. Weber. Komplexität von Hypothesenräumen in der Induktiven Logischen Programmierung. Diplomarbeit Nr. 1164, Universität Stuttgart, Fakultät Informatik, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, I., Tausend, B., Stahl, I. (1995). Language series revisited: The complexity of hypothesis spaces in ILP (Extended abstract). In: Lavrac, N., Wrobel, S. (eds) Machine Learning: ECML-95. ECML 1995. Lecture Notes in Computer Science, vol 912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59286-5_87
Download citation
DOI: https://doi.org/10.1007/3-540-59286-5_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59286-0
Online ISBN: 978-3-540-49232-0
eBook Packages: Springer Book Archive