Table of Contens

 ALT '95 Logo

K.P. Jantke, T. Shinohara and T. Zeugmann
Editors' Introduction ix

SESSION 1
Y. Sakakibara
Grammatical Inference: An Old and New Paradigm (Invited Lecture)
Abstract. 		1

SESSION 2
A.F. Fahmy and R. Roos
Efficient learning of real time one-counter automata 25
T. Koshiba, E. Mäkinen and Y. Takada
Learning strongly deterministic even linear languages from positive examples 41
H. Sakamoto
Language learning from membership queries and characteristic examples 55
H. Arimura, H. Ishizaka and T. Shinohara
Learning unions of tree patterns using queries 66

SESSION 3
L. De Raedt and W. Van Lear
Inductive constraint logic 80
M.R.K.Krishna Rao
Incremental learning of logic programs 95
A. Miyashiro, E. Takimoto, Y. Sakai and A. Maruoka
Learning orthogonal F-Horn formulas 110

SESSION 4
P. Auer
Learning of nested differences in the presence of malicious noise 123
A. Nakamura and S. Miura
Learning sparse linear combinations of basis functions over a finite domain 138

SESSION 5
John Kececioglu, Ming Li and John Tromp
Inferring a DNA sequence from erroneous copies (Invited Lecture) 151

SESSION 6
J. Case, S. Jain and A. Sharma
Machine induction without revolutionary paradigm shifts 153
L. Meyer
Probabilistic language learning under monotonicity constraints 169
F. Stephan
Noisy inference and oracles 185
B. Kalyanasundaram and M. Velauthapillai
Simulating teams with many conjectures 201

SESSION 7
C.C. Pinter
Complexity of network training for classes of neural networks 215
R. Gavaldà and D. Guijarro
Learning ordered binary decision diagrams 228
J. Castro and J.L. Balcázar
Simple PAC learning of simple decision lists 239

SESSION 8
C. Domingo and J. Shawe-Taylor
The complexity of minor closed graph classes 249

SESSION 9
Yves Kodratoff
Technical and scientific issues of KDD (or: Is KDD a science) (Invited Lecture) 261

SESSION 10
K. Sadohara and M. Haraguchi
Analogical logic program synthesis algorithm that can refute inappropriate similarities 266
K.P. Jantke
Reflecting and self-confident inductive inference machines 282
S. Kobayashi and T. Yokomori
On approximately identifying concept classes in the limit 298
A. Ambainis
Application of Kolmogoroff complexity to inductive inference with limited memory 313
Author Index
319
©Copyright Notice:
The document of this page is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provision of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under German Copyright Law.
uparrowback to the ALT'95 Proceedings Page

uparrowuparrow back to the Conference Page

Valid HTML 4.1