Algorithmic Learning for Knowledge-Based Systems
GOSLER Final Report, Lecture Notes in Computer Science 961 - Lecture Notes in Ar
P Jantke, Klaus / Lange, /
Erschienen am
01.10.2007
Beschreibung
InhaltsangabeLearning and consistency.- Error detecting in inductive inference.- Learning from good examples.- Towards reduction arguments for FINite learning.- Not-so-nearly-minimal-size program inference (preliminary report).- Optimization problem in inductive inference.- On identification by teams and probabilistic machines.- Topological considerations in composing teams of learning machines.- Probabilistic versus deterministic memory limited learning.- Classification using information.- Classifying recursive predicates and languages.- A guided tour across the boundaries of learning recursive languages.- Pattern inference.- Inductive learning of recurrence-term languages from positive data.- Learning formal languages based on control sets.- Learning in case-based classification algorithms.- Optimal strategies - Learning from examples - Boolean equations.- Feature construction during tree learning.- On lower bounds for the depth of threshold circuits with weights from {?1,0,+1}.- Structuring neural networks and PAC-Learning.- Inductive synthesis of rewrite programs.- TLPS - A term rewriting laboratory (not only) for experiments in automatic program synthesis.- GoslerP - A logic programming tool for inductive inference.