Advertisement

Language series revisited: The complexity of hypothesis spaces in ILP (Extended abstract)

  • Irene Weber
  • Birgit Tausend
  • Irene Stahl
Extended Abstracts
Part of the Lecture Notes in Computer Science book series (LNCS, volume 912)

References

  1. 1.
    Adé, Hilde, Luc De Raedt und Maurice Bruynooghe. Declarative Bias for Bottom-up ILP Learning Systems, 1994. To appear in Machine Learning.Google Scholar
  2. 2.
    Muggleton, S., C. Feng. Efficient Induction of Logic Programs. Proc. of the 1st Conference on Algorithmic Learning Theory, Tokyo, OHMSHA, 1990.Google Scholar
  3. 3.
    L. De Raedt. Interactive Theory Revision: an Inductive Logic Programming Approach. Academic Press, 1992.Google Scholar
  4. 4.
    I. Stahl and I. Weber. The Arguments of Newly Invented Predicates in ILP. In Proc. of ILP-94, 1994.Google Scholar
  5. 5.
    I. Weber. Komplexität von Hypothesenräumen in der Induktiven Logischen Programmierung. Diplomarbeit Nr. 1164, Universität Stuttgart, Fakultät Informatik, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Irene Weber
    • 1
  • Birgit Tausend
    • 1
  • Irene Stahl
    • 1
  1. 1.Fakultät InformatikUniversität StuttgartStuttgart

Personalised recommendations