Inferability of Unbounded Unions of Certain Closed Set Systems

  • Yuichi Kameda
  • Hiroo Tokunaga
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6284)


In this article, we study inferability from positive data for the unbounded union of certain class of languages. In order to show inferability, we put an emphasis on a characteristic set of a given language. We consider a class of closed set systems such that there exists an algorithm for generating a characteristic set consisting of one element. Two concrete examples of closed set systems with such algorithms are given. Furthermore, we consider applications of these examples to the study of transaction databases.


Invariant Subspace Polynomial Ring Closure Operator Inference Algorithm Positive Data 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control 45, 117–135 (1980)CrossRefzbMATHGoogle Scholar
  2. 2.
    de Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of Closed Set Systems From Positive Data. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol. 4384, pp. 265–275. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Heidelberg (1992)CrossRefzbMATHGoogle Scholar
  4. 4.
    Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447–474 (1967)CrossRefzbMATHGoogle Scholar
  5. 5.
    Kameda, Y., Tokunaga, H., Yamamoto, A.: Learning bounded unionsof Noetherian closed set systems via characteristic sets. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 98–110. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Kapur, S., Bilardi, G.: On uniform learnability of language families. Information Processing Letters 44, 35–38 (1992)CrossRefzbMATHGoogle Scholar
  7. 7.
    Kobayashi, S.: 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)Google Scholar
  8. 8.
    Lassez, J.L., Maher, M.J., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–626. Morgan Kaufman, San Francisco (1988)CrossRefGoogle Scholar
  9. 9.
    Motoki, T., Shinohara, T., Wright, K.: The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. In: Proceedings of COLT 1991, p. 375, 587–626. Morgan-Kaufman, San Francisco (1988)Google Scholar
  10. 10.
    Shinohara, T., Arimura, H.: Inductive Inference of Unbounded Unions of Pattern Languages From Positive Data. Theoretical Computer Science 241, 191–209 (2000)CrossRefzbMATHGoogle Scholar
  11. 11.
    Takamatsu, I., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Computing Characteristic Sets of Bounded Unions of Polynomial Ideals. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol. 4914, pp. 318–329. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Wright, K.: Identification of Unions of Languages Drawn from an Identifiable Class. In: Proc. of COLT 1989, pp. 328–388. Morgan-Kaufman, San Francisco (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yuichi Kameda
    • 1
  • Hiroo Tokunaga
    • 1
  1. 1.Department of Mathematics and Information Sciences, Graduate School of Science and EngineeringTokyo Metropolitan UniversityHachioji-shiJapan

Personalised recommendations