Advertisement

Inductive Logic Programming

11th International Conference, ILP 2001 Strasbourg, France, September 9–11, 2001 Proceedings

  • Céline Rouveirol
  • Michéle Sebag
Conference proceedings ILP 2001

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2157)

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, volume 2157)

Table of contents

  1. Front Matter
    Pages I-X
  2. Liviu Badea
    Pages 1-14
  3. Rodrigo Basilio, Gerson Zaverucha, Valmir C. Barbosa
    Pages 15-26
  4. Agnès Braud, Christel Vrain
    Pages 27-40
  5. Martin Eineborg, Henrik Boström
    Pages 41-50
  6. Susanne Hoche, Stefan Wrobel
    Pages 51-64
  7. Nico Jacobs, Hendrik Blockeel
    Pages 80-90
  8. Andreas Karwath, Ross D. King
    Pages 91-103
  9. Kristian Kersting, Luc De Raedt
    Pages 104-117
  10. Kristian Kersting, Luc De Raedt
    Pages 118-131
  11. Mark-A. Krogel, Stefan Wrobel
    Pages 142-155
  12. Donato Malerba, Francesca A. Lisi
    Pages 156-163
  13. Jérôme Maloberti, Michèle Sebag
    Pages 164-178
  14. Ramón P. Otero
    Pages 193-205
  15. Tomonobu Ozaki, Koichi Furukawa
    Pages 206-219
  16. René Quiniou, Marie-Odile Cordier, Guy Carrault, Feng Wang
    Pages 220-227
  17. Jan Struyf, Hendrik Blockeel
    Pages 228-239
  18. Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura
    Pages 240-247
  19. Filip Železný
    Pages 248-259
  20. Back Matter
    Pages 261-261

About these proceedings

Keywords

Constraint Satisfaction algorithm algorithms data mining genetic algorithms learning logic machine learning programming supervised learning

Editors and affiliations

  • Céline Rouveirol
    • 1
  • Michéle Sebag
    • 2
  1. 1.Université Paris Sud, LRIOrsayFrance
  2. 2.Ecole Polytechnique, LMSPalaiseauFrance

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44797-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42538-0
  • Online ISBN 978-3-540-44797-9
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site