Learning conjunctions of Horn clauses-Reference-Cited by-同舟云学术

Learning conjunctions of Horn clauses

Published:1992-07 Issue:2-3 Volume:9 Page:147-164
ISSN:0885-6125
Container-title:Machine Learning
language:en
Short-container-title:Mach Learn

Author:

Angluin Dana,Frazier Michael,Pitt Leonard

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00992675.pdf

Reference20 articles.

1. Angluin, D. (1988). Learning with hints. InProceedings of the 1988 Workshop on Computational Learning Theory (pp. 167?181). Boston, MA: Morgan Kaufmann.

2. Angluin, D. (1988). Queries and concept learning.Machine Learning, 2, 319?342.

3. Angluin, D. (1988).Requests for hints that return no hints (Technical Report YALE/DCS/RR-647). Department of Computer Science, Yale University.

4. Angluin, D. (1990). Negative results for equivalence queries.Machine Learning, 5, 121?150.

5. Angluin, D., Frazier, M., & Pitt, L. (1990). Learning conjunctions of Horn clauses. InProceedings of the 31st Annual Symposium on Foundations of Computer Science (pp. 186?192). St. Louis, MO: IEEE Computer Society Press.

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

1. Reasoning and learning in the setting of possibility theory - Overview and perspectives;International Journal of Approximate Reasoning;2023-09

2. Learning Horn envelopes via queries from language models;International Journal of Approximate Reasoning;2023-09

3. Learning constraints through partial queries;Artificial Intelligence;2023-06

4. Learning a Propagation Complete Formula;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022

5. Copy complexity of Horn formulas with respect to unit read-once resolution;Theoretical Computer Science;2021-10