Inferability of unbounded unions of certain closed set systems

Authors:
Yuichi Kameda;Hiroo Tokunaga
Affiliations:
Department of Mathematics and Information Sciences, Graduate School of Science and Engineering, Tokyo Metropolitan University, Hachioji-shi, Japan;Department of Mathematics and Information Sciences, Graduate School of Science and Engineering, Tokyo Metropolitan University, Hachioji-shi, Japan
Venue:
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Year:
2009

Citing 7
Cited 0

Unification revisited

Foundations of deductive databases and logic programming
Identification of unions of languages drawn from an identifiable class

COLT '89 Proceedings of the second annual workshop on Computational learning theory
On uniform learnability of language families

Information Processing Letters
Inductive inference of unbounded unions of pattern languages from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory
Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Inferability of closed set systems from positive data

JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Computing characteristic sets of bounded unions of polynomial ideals

JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.