Inferability of Closed Set Systems from Positive Data-Reference-Cited by-同舟云学术

Inferability of Closed Set Systems from Positive Data

Published:2007 Issue: Volume: Page:265-275
ISSN:0302-9743
Container-title:New Frontiers in Artificial Intelligence
language:
Short-container-title:

Author:

de Brecht Matthew,Kobayashi Masanori,Tokunaga Hiroo,Yamamoto Akihiro

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/978-3-540-69902-6_23

Reference17 articles.

1. Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control 45, 117–135 (1980)

2. Angluin, D.: Inference of Reversible Languages. Journal of the ACM 29, 741–765 (1982)

3. Arikawa, S., Miyano, S., Shinohara, A., Shinohara, T., Yamamoto, A.: Algorithmic Learning Theory with Elementary Formal Systems. IECE Trans. Inf. & Syst. vol. E75-D 4, 405–414 (1992)

4. Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society (1967)

5. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, Heidelberg (1981)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Learning Families of Ideals in Lattices and Boolean Algebras;Lecture Notes in Computer Science;2024

2. Learning in the limit with lattice-structured hypothesis spaces;Theoretical Computer Science;2012-10

3. Learning Families of Closed Sets in Matroids;Computation, Physics and Beyond;2012

4. String Extension Learning Using Lattices;Language and Automata Theory and Applications;2010

5. Inferability of Unbounded Unions of Certain Closed Set Systems;New Frontiers in Artificial Intelligence;2010