Algorithmic Learning for Knowledge-Based Systems: GOSLER Final Report

✍ Scribed by Rolf Wiehagen, Thomas Zeugmann (auth.), Klaus P. Jantke, Steffen Lange (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1995
• Tongue: English
• Leaves: 521
• Series: Lecture Notes in Computer Science 961 : Lecture Notes in Artificial Intelligence
• Edition: 1
• Category: Library

✦ Synopsis

This book is the final report on a comprehensive basic research project, named GOSLER on algorithmic learning for knowledge-based systems supported by the German Federal Ministry of Research and Technology during the years 1991 - 1994. This research effort was focused on the study of fundamental learnability problems integrating theoretical research with the development of tools and experimental investigation.
The contributions by 11 participants in the GOSLER project is complemented by contributions from 23 researchers from abroad. Thus the volume provides a competent introduction to algorithmic learning theory.

✦ Table of Contents

Learning and consistency....Pages 1-24
Error detecting in inductive inference....Pages 25-48
Learning from good examples....Pages 49-62
Towards reduction arguments for FINite learning....Pages 63-75
Not-so-nearly-minimal-size program inference (preliminary report)....Pages 76-95
Optimization problem in inductive inference....Pages 96-107
On identification by teams and probabilistic machines....Pages 108-145
Topological considerations in composing teams of learning machines....Pages 146-154
Probabilistic versus deterministic memory limited learning....Pages 155-161
Classification using information....Pages 162-173
Classifying recursive predicates and languages....Pages 174-189
A guided tour across the boundaries of learning recursive languages....Pages 190-258
Pattern inference....Pages 259-291
Inductive learning of recurrence-term languages from positive data....Pages 292-315
Learning formal languages based on control sets....Pages 316-339
Learning in case-based classification algorithms....Pages 340-362
Optimal strategies — Learning from examples — Boolean equations....Pages 363-390
Feature construction during tree learning....Pages 391-403
On lower bounds for the depth of threshold circuits with weights from {−1,0,+1}....Pages 404-416
Structuring neural networks and PAC-Learning....Pages 417-434
Inductive synthesis of rewrite programs....Pages 435-466
T L P S — A term rewriting laboratory (not only) for experiments in automatic program synthesis....Pages 467-481
GoslerP — A logic programming tool for inductive inference....Pages 482-510

✦ Subjects

Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages