Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications

TOTAL DOCUMENTS

45

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540585206, 9783540490302

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Inductive inference of an approximate concept from positive data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_85 ◽

1994 ◽

pp. 484-499 ◽

Author(s):

Yasuhito Mukouchi

Keyword(s):

Inductive Inference ◽

Download Full-text

Learning concatenations of locally testable languages from positive data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_80 ◽

1994 ◽

pp. 407-422 ◽

Author(s):

Satoshi Kobayashi ◽

Takashi Yokomori

Keyword(s):

Download Full-text

Language learning under various types of constraint combinations

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_77 ◽

1994 ◽

pp. 365-378

Author(s):

Shyam Kapur

Keyword(s):

Language Learning

Download Full-text

On monotonic strategies for learning r.e. languages

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_76 ◽

1994 ◽

pp. 349-364 ◽

Author(s):

Sanjay Jain ◽

Arun Sharma

Download Full-text

Learning from examples with typed equational programming

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_73 ◽

1994 ◽

pp. 301-316 ◽

Author(s):

Akira Ishino ◽

Akihiro Yamamoto

Keyword(s):

Learning From Examples

Download Full-text

On-line learning with malicious noise and the closure algorithm

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_67 ◽

1994 ◽

pp. 229-247 ◽

Author(s):

Peter Auer ◽

Nicoló Cesa-Bianchi

Keyword(s):

On Line ◽

On Line Learning ◽

Closure Algorithm

Download Full-text

Explanation-based reuse of prolog programs

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_61 ◽

1994 ◽

pp. 149-160

Author(s):

Yasuyuki Koga ◽

Eiju Hirowatari ◽

Setsuo Arikawa

Keyword(s):

Prolog Programs

Download Full-text

Rule-generating abduction for recursive prolog

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_59 ◽

1994 ◽

pp. 121-136

Author(s):

Kouichi Hirata

Download Full-text

Learning with higher order additional information

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_54 ◽

1994 ◽

pp. 64-75 ◽

Author(s):

Ganesh Baliga ◽

John Case

Keyword(s):

Higher Order ◽

Additional Information

Download Full-text

Enumerable classes of total recursive functions: Complexity of inductive inference

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-58520-6_50 ◽

1994 ◽

pp. 10-25 ◽

Author(s):

Andris Ambainis ◽

Juris Smotrovs

Keyword(s):

Inductive Inference ◽

Recursive Functions

Download Full-text