Author:
Arias Marta,Balcázar José L.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference28 articles.
1. Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87–106.
2. Angluin, D., & Kharitonov, M. (1995). When won’t membership queries help? Journal of Computer and System Sciences, 50(2), 336–355.
3. Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of Horn clauses. Machine Learning, 9, 147–164.
4. LNAI;M. Arias,2008
5. LNAI;M. Arias,2009
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Horn envelopes via queries from language models;International Journal of Approximate Reasoning;2023-09
2. Unique key Horn functions;Theoretical Computer Science;2022-06
3. Approximate Computation of Exact Association Rules;Formal Concept Analysis;2021
4. From equivalence queries to PAC learning: The case of implication theories;International Journal of Approximate Reasoning;2020-12
5. Exact Learning;ACM Transactions on Computation Theory;2020-02-25