default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd ALT 1991: Tokyo, Japan
- Setsuo Arikawa, Akira Maruoka, Taisuke Sato:
Algorithmic Learning Theory, 2nd International Workshop, ALT '91, Tokyo, Japan, October 23-25, 1991, Proceedings. Ohmsha 1991
Invited Papers
- Yoshifumi Sakai:
The logic of molecular geneticists for the understanding of genetic information. ALT 1991: 3-5 - Nick Littlestone:
Learning simple Boolean concepts. ALT 1991: 6-14 - Pavel Brazdil:
Learning in multi-agent environments. ALT 1991: 15-
Neural Networks
- Akira Namatame:
Knowledge-intensive learning in connectionist networks. ALT 1991: 35-46 - Haruo Kimoto, Toshiaki Iwadera:
Learning effect of a dynamic thesaurus in associated information retrieval. ALT 1991: 47-60
Inductive Inference
- Noriyuki Tanida, Takashi Yokomori:
Polynomial-time identification of very regular languages in the limit. ALT 1991: 61-72 - Akito Sakurai:
Inductive inference of formal languages from positive data enumerated primitive-recursively. ALT 1991: 73-83 - Masako Sato, Kazutaka Umayahara:
Inductive inferability for formal languages from positive data. ALT 1991: 84-92 - Yasuhito Mukouchi:
Characterization of pattern languages. ALT 1991: 93-104 - Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki:
Polynomial-time inference of unions of tree pattern languages. ALT 1991: 105-114 - Seiichi Tani:
On the role of equivalence queries in MAT learning. ALT 1991: 115-125 - Yuji Takada, Yasubumi Sakakibara, Takeshi Ohtani:
ACE: A syntax-directed editor customizable from examples and queries. ALT 1991: 126-138
Approximate Learning
- Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara:
Which classes of elementary formal systems are polynomial-time learnable. ALT 1991: 139-150 - Eiji Takimoto, Akira Maruoka:
Relationships between PAC-learning algorithms and weak Occam algorithms. ALT 1991: 151-162 - Naoki Abe:
Preservation of predictability under polynomial sparse variations and its applications. ALT 1991: 163-174 - Kenji Yamanishi:
Learning non-parametric densities by finite-dimensional parametric hypotheses. ALT 1991: 175-186 - Yasuyuki Tsukada, Kenji Koyama:
A knowledge transfer model: From zero-knowledge to full-knowledge. ALT 1991: 187-195 - Kenji Koyama, Tony W. Lai:
An interactive knowledge transfer model and analysis of "Mastermind" game. ALT 1991: 196-206
Analogical Reasoning
- Shinji Furuya, Satoru Miyano:
Analogy is NP-hard. ALT 1991: 207-212 - Ken-etsu Fujita, Masateru Harao:
Proving based on similarity. ALT 1991: 213-223 - Tetsuhiro Miyahara:
Analogical reasoning using elementary formal systems with mismatch. ALT 1991: 224-231 - Masaki Suwa, Hiroshi Motoda:
The use of abstract primitives in representing the meanings of "Verbs" for understanding metaphors. ALT 1991: 231-242 - Ryohei Orihara:
Analogical reasoning as a form of hypothetical reasoning and justification-based knowledge acquisition. ALT 1991: 243-254 - Jun Arima:
A logical analysis of relevance in analogy. ALT 1991: 255-265 - Makoto Haraguchi:
A form of analogy as an abductive inference. ALT 1991: 266-277
Inductive Logic Programming
- Somkiat Tangkitvanich, Masamichi Shimura:
Recovery from multiple faults in relational theory. ALT 1991: 277-287 - Seiichiro Sakurai, Makoto Haraguchi:
Towards learning by abstraction. ALT 1991: 288-298 - Koichi Furukawa:
Preliminary study on program sunthesis based on induction and verification. ALT 1991: 299-306
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-02 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
