Inferability of closed set systems from positive data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4384 LNAI, Issue , 2007, Pages 265-275

  De Brecht, Matthew ^a   Kobayashi, Masanori ^b   Tokunaga, Hiroo ^b   Yamamoto, Akihiro ^a  

^a KYOTO UNIVERSITY   (Japan)

^b TOKYO METROPOLITAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION;

ALGEBRAIC STRUCTURES; CLOSED SET SYSTEMS; INFERABILITY; POSITIVE DATA;

INFERENCE ENGINES;

EID: 34548067126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69902-6_23     Document Type: Conference Paper

References (17)

1. D. Angluin: Inductive Inference of Formal Languages from Positive Data. Information and Control, 45 (1980) 117-135.
2. D. Angluin: Inference of Reversible Languages. Journal of the ACM, 29 (1982) 741-765.
3. S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, A. Yamamoto: Algorithmic Learning Theory with Elementary Formal Systems. IECE Trans. Inf. & Syst. Vol. E75-D 4 (1992) 405-414.
4. G. Birkhoff: Lattice Theory, Third Edition. American Mathematical Society (1967).
5. S. Burris, H. P. Sankappanavar: A Course in Universal Algebra. Springer-Verlag (1981).
6. P. M. Cohn: Universal Algebra. Harper & Row (1965).
7. M. de Brecht and A. Yamamoto: Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages From Positive Data. Proceedings of the 17th International Conference on Algorithmic Learning Theory (Lecture Notes in Artificial Intelligence 4264) (2006) 124-138.
8. E. M. Gold: Language Identification in the Limit. Information and Control, 10 (1967) 447-474.
9. S. Jain, D. Osherson, J. Royer, and A. Sharma. Systems that Learn: An Introduction to Learning Theory, Second Edition. MIT Press (1999).
10. M. Kobayashi, H.Tokunaga, and A. Yamamoto: Ideals of Polynomial Rings and Learning from Positive Data (in Japanese). Proceedings of the 8th Workshop on Information-Based Induction Science (2005) 129-134.
11. S. Kobayashi, T. Yokomori: On approximately identifying concept classes in the limit. Proceedings of the 6th International Workshop on Algorithmic Learning Theory (Lecture Notes in Artificial Intelligence 997) (1995) 298-312.
12. S. Kobayashi: Approximate Identification, Finite Elasticity and Lattice Structure of Hypothesis Space. Technical Report, CSIM 96-04, Dept. of Compt. Sci. and Inform. Math., Univ. of Electro- Communications (1996).
13. T. Motoki, T. Shinohara, and K. Wright: The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. Proceedings of COLT '91 (1991) 375.
14. T. Shinohara: Inductive Inference of Monotonie Formal Systems From Positive Data. New Generation Computing, 8 (1991) 371-384.
15. T. Shinohara, H. Arimura: Inductive Inference of Unbounded Unions of Pattern Languages From Positive Data. Theoretical Computer Science, 241 (2000) 191-209.
16. F. Stephan and Y. Ventsov: Learning Algebraic Structures from Text. Theoretical Computer Science, 268 (2001) 221-273.
17. K. Wright: Identification of Unions of Languages Drawn from an Identifiable Class. Proceedings of COLT '89, (1989) 328-333.