Kurt Ammon: | |
|
Some Experiments With a Learning Procedure.
| | 87-98
|
Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, and
Juris Smotrovs: | |
|
Unions of Identifiable Classes of Total Recursive Functions.
| | 99-107
|
Ganesh Baliga, Sanjay Jain, and Arun Sharma: | |
|
Learning from Multiple Sources of Inaccurate Data.
| | 108-128
|
John Case, Keh-Jiann Chen, and Sanjay Jain: | |
|
Strong Separation of Learning Classes.
| | 129-139
|
William W. Cohen: | |
|
Desiderata for Generalization-to-N Algorithms.
| | 140-150
|
Robert P. Daley, Bala Kalyanasundaram, and Mahe Velauthapillai: | |
|
The Power of Probabilism in Popperian FINite Learning (extended abstract).
| | 151-169
|
Peter A. Flach: | |
|
An Analysis of Various Forms of ‘Jumping to Conclusions’.
| | 170-186
|
Rusins Freivalds and Achim Hoffmann: | |
|
An Inductive Inference Appoach to Classification.
| | 187-196
|
William I. Gasarch and Mahendran Velauthapillai: | |
|
Asking Questions Versus Verifiability.
| | 197-213
|
Bipin Indurkhya: | |
|
Predicative Analogy and Cognition.
| | 214-231
|
Efim Kinber: | |
|
Learning A Class of Regular Expressions via Restricted Subset Queries.
| | 232-243
|
Steffen Lange and Thomas Zeugmann: | |
|
A Unifying Approach to Monotonic Langauge Learning on Informant.
| | 244-259
|
Yasuhito Mukouchi: | |
|
Characterization of Finite Identification.
| | 260-267
|
Scott O'Hara: | |
|
A Model of the ‘Redescription’ Process in the Context of Geometric
Proportional Analogy Problems.
| | 268-293
|
Foster J. Provost and Bruce G. Buchanan: | |
|
Inductive Strengthening: the Effects of a Simple Heuristic for
Restricting Hypothesis Space Search.
| | 294-304
|
Yuji Takada: | |
|
On Identifying DNA Splicing Systems from Examples.
| | 305-319
|