4. AII/ 5. ALT 1994:
Reinhardsbrunn Castle,
Germany
Setsuo Arikawa, Klaus P. Jantke (Eds.):
Algorithmic Learning Theory, 4th International Workshop on Analogical and Inductive Inference, AII '94, 5th International Workshop on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle, Germany, October 10-15, 1994, Proceedings.
Lecture Notes in Computer Science 872 Springer 1994, ISBN 3-540-58520-6 BibTeX
@proceedings{DBLP:conf/alt/1994,
editor = {Setsuo Arikawa and
Klaus P. Jantke},
title = {Algorithmic Learning Theory, 4th International Workshop on Analogical
and Inductive Inference, AII '94, 5th International Workshop
on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle,
Germany, October 10-15, 1994, Proceedings},
booktitle = {AII/ALT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {872},
year = {1994},
isbn = {3-540-58520-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Analogical and Inductive Inference
Invited Talks
Selected Papers
- Andris Ambainis, Juris Smotrovs:
Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference.
10-25 BibTeX
- Kalvis Apsitis:
Derived Sets and Inductive Inference.
26-39 BibTeX
- Oksana Arnold, Klaus P. Jantke:
Therapy Plan Generation as Program Synthesis.
40-55 BibTeX
- Shuo Bai:
A Calculus for Logical Clustering.
56-63 BibTeX
- Ganesh Baliga, John Case:
Learning with Higher Order Additional Information.
64-75 BibTeX
- Alvis Brazma, Karlis Cerans:
Efficient Learning of Regular Expressions from Good Examples.
76-90 BibTeX
- Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen:
Identifying Nearly Minimal Gödel Numbers From Additional Information.
91-99 BibTeX
- Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith:
Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions.
100-105 BibTeX
- Christoph Globig, Steffen Lange:
On Case-Based Representability and Learnability of Languages.
106-120 BibTeX
- Kouichi Hirata:
Rule-Generating Abduction for Recursive Prolog.
121-136 BibTeX
- Toshiharu Iwatani, Shun'ichi Tano, Atsushi Inoue, Wataru Okamoto:
Fuzzy Analogy Based Reasoning and Classification of Fuzzy Analogies.
137-148 BibTeX
- Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa:
Explanation-Based Reuse of Prolog Programs.
149-160 BibTeX
- Chowdhury Rahman Mofizur, Masayuki Numao:
Constructive Induction for Recursive Programs.
161-175 BibTeX
- Hsieh-Chang Tu, Carl H. Smith:
Training Diagraphs.
176-186 BibTeX
Algorithmic Learning Theory
Invited Talks
Selected Papers
- Peter Auer, Nicolò Cesa-Bianchi:
On-line Learning with Malicious Noise and the Closure Algorithm.
229-247 BibTeX
- Shai Ben-David, Eli Dichterman:
Learnability with Restricted Focus of Attention guarantees Noise-Tolerance.
248-259 BibTeX
- Alvis Brazma:
Efficient Algorithm for Learning Simple Regular Expressions from Noisy Examples.
260-271 BibTeX
- Zhixiang Chen:
A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership Queries.
272-281 BibTeX
- Claudio Ferretti, Giancarlo Mauri:
Identifying Regular Languages over Partially-Commutative Monoids.
282-289 BibTeX
- William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai:
Classification Using Information.
290-300 BibTeX
- Akira Ishino, Akihiro Yamamoto:
Learning from Examples with Typed Equational Programming.
301-316 BibTeX
- Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara:
Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries.
317-332 BibTeX
- Sanjay Jain:
Program Synthesis in the Presence of Infinite Number of Inaccuracies.
333-348 BibTeX
- Sanjay Jain, Arun Sharma:
On Monotonic Strategies for Learning r.e. Languages.
349-364 BibTeX
- Shyam Kapur:
Language Learning under Various Types of Constraint Combinations.
365-378 BibTeX
- Shigetomo Kimura, Atsushi Togashi, Norio Shiratori:
Synthesis Algorithm for Recursive Process by µ-calculus (Extended Abstract).
379-394 BibTeX
- Efim B. Kinber:
Monotonicity versus Efficiency for Learning Languages from Texts.
395-406 BibTeX
- Satoshi Kobayashi, Takashi Yokomori:
Learning Concatenations of Locally Testable Languages from Positive Data.
407-422 BibTeX
- Steffen Lange, Jochen Nessel, Rolf Wiehagen:
Language Learning from Good Examples.
423-437 BibTeX
- Steffen Lange, Phil Watson:
Machine Discovery in the Presence of Incomplete or Ambiguous Data.
438-452 BibTeX
- Steffen Lange, Thomas Zeugmann:
Set-Driven and Rearrangement-Independent Learning of Recursive Languages.
453-468 BibTeX
- Satoshi Matsumoto, Ayumi Shinohara:
Refutably Probably Approximately Correct Learning.
469-483 BibTeX
- Yasuhito Mukouchi:
Inductive Inference of an Approximate Concept from Positive Data.
484-499 BibTeX
- Atsuyoshi Nakamura, Naoki Abe, Jun-ichi Takeuchi:
Efficient Distribution-free Population Learning of Simple Concepts.
500-515 BibTeX
- Yoshiaki Okubo, Makoto Haraguchi:
Constructing Predicate Mappings for Goal-Dependent Abstraction.
516-531 BibTeX
- Yasubumi Sakakibara, Klaus P. Jantke, Steffen Lange:
Learning Languages by Collecting Cases and Tuning Parameters.
532-546 BibTeX
- Eiji Takimoto, Ichiro Tajika, Akira Maruoka:
Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm.
547-559 BibTeX
- Noriyuki Tanida, Takashi Yokomori:
Inductive Inference of Monogenic Pure Context-free Languages.
560-573 BibTeX
Copyright © Sat May 16 22:57:36 2009
by Michael Ley (ley@uni-trier.de)
