CLASSIC learning

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 23-34

  Frazier, Michael ^a   Pitt, Leonard ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION;

DESCRIPTION LOGIC; EFFICIENT LEARNING; EQUIVALENCE QUERIES; EXACT LEARNING; MEMBERSHIP QUERY; MISCLASSIFICATIONS; POLYNOMIAL-TIME; SOURCES OF INFORMATIONS;

KNOWLEDGE BASED SYSTEMS;

EID: 84968323041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.174994     Document Type: Conference Paper

References (38)

1. D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75(2):87-106, November 1987.
2. D. Angluin. Learning with hints. In Proc. 1st Annu. Workshop on Comput. Learning Theory, pages 167-181. Morgan Kaufmann, San Mateo, CA, 1988.
3. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, April 1988.
4. D. Angluin. Requests for hints that return no hints. Technical report, Yale University, YALE/DCS/RR-647, 1988.
5. D. Angluin. Exact learning of μ-DNF formulas with malicious membership queries. Technical Report YALEU/DCS/TR-1020, Yale University, March 1994.
6. D. Angluin and M. Krikis. Learning with malicious membership queries and exceptions. In Proc. 7th Annu. Conference on Comput. Learning Theory. ACM Press, New York, NY, July 1994.
7. D. Angluin and D. K. Slonim. Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle. Machine Learning, 14:7-26, 1994.
8. Dana Angluin. Computational learning theory: survey and selected bibliography. In 24th Annual ACMSTOC, 1992.
9. H. Beck, H. Gala, and S. Navathe. Classification as a query processing technique in the CANDIDE semantic model. In Data Engineering Conference, pages 572-581, Los Angeles, CA, 1989.
10. Daniel G. Bobrow and Terry Winograd. An overview of KRL, a knowledge representation language. Cognitive Science, l(l):3-46, 1977.
11. A. Borgida, R. J. Brachman, D. L. McGuinness, and L. Resnick. CLASSIC: A structural data model for objects. In Proceedings of SIGMOD-89, Portland, Oregon, 1989.
12. Alex Borgida. Description logics are not just for the flightless-birds: a new look at the utility and foundations of description logics. 1992.
13. Alex Borgida and Peter F. Patel-Schneider. A semantics and complete algorithm for subsumption in the CLASSIC description logic. Technical report, AT&T, 1992.
14. R. J. Brachman, R. E. Fikes, and H. J. Levesque. Krypton: A functional approach to knowledge representation. IEEE Computer, 16(10):67-73, 1983.
15. Z. Chen and W. Maass. On-line learning of rectangles. In Proc. 5th Annu. Workshop on Comput. Learning Theory, pages 16-28. ACM Press, New York, NY, 1992.
16. W. W. Cohen and H. Hirsh. Learnability of description logics. In Proc. 5th Annu. Workshop on Comput. Learning Theory, pages 116-127. ACM Press, New York, NY, 1992.
17. William Cohen. Cryptographic limitations on learning one-clause logic programs. In Proceedings of the Tenth National Conference on Artificial Intelligence, Washington, D.C., 1993.
18. William Cohen. Pac-learning a restricted class of recursive logic programs. In Proceedings of the Tenth National Conference on Artificial Intelligence, Washington, D.C., 1993.
19. William W. Cohen, Alex Borgida, and Haym Hirsh. Computing least common subsumers in description logics. In Proceedings of the Tenth National Conference on Artificial Intelligence, 1992.
20. William W. Cohen and Haym Hirsh. Learnability of description logics with equality constraints. To appear in the special issue of Machine Learning containing selections from COLT 92; available from the authors.
21. William W. Cohen and Haym Hirsh. Learning the CLASSIC description logic: Theoretical and experimental results. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR94)-Morgan Kaufmann, 1994.
22. P. Devanbu, R. J. Brachman, P. Selfridge, and B. Ballard. LaSSIE: A knowledge-based software information system. Communications of the ACM, 35(5), 1991.
23. Thomas Glen Dietterich, Bob London, Kenneth Clarkson, and Geoff Dromey. Learning and inductive inference. In The Handbook of Artificial Intelligence, Volume 3. William Kaufmann, 1982.
24. Saso Dzeroski, Stephen Muggleton, and Stuart Russell. Pac-learnability of logic programs. In Proceedings of the 1992 Workshop on Computational Learning Theory, pages 128-135, New York, 1992. The Association for Computing Machinery.
25. M. Frazier, S. Goldman, N. Mishra, and L. Pitt. Learning from a consistently ignorant teacher. In Proc. 7th Annu. Conference on Comput. Learning Theory. ACM Press, New York, NY, July 1994.
26. M. Frazier and C. D. Page. Learnability of recursive, non-determinate theories: Some basic results and techniques. In Third International Workshop on Inductive Logic Programming, 1993.
27. Michael Frazier and Leonard Pitt. Learning from entailment: An application to propositional horn sentences. In Proceedings of the Tenth Internation Conference on Machine Learning, 1993.
28. D. Haussler. Learning conjunctive concepts in structural domains. Machine Learning, 4:7-40, 1989.
29. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. of the Amer. Stat. Assoc., 58(301):13-30, March 1963.
30. N. Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
31. S. Marcus, editor. Machine Learning: Special Issue on Knowledge Acquisition, volume 3/4. December 1989.
32. E. Mays, C. Apte, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, pages 61-70, Fall 1987.
33. S. Muggleton. Inductive logic programming. New Generation Computing, 8:295-318, 1991.
34. C. D. Page and A. M. Frisch. Generalization and learnability: A study of constrained atoms. In S. H. Muggleton, editor, Inductive Logic Programming, chapter 2, pp. 29-60. Academic Press, London, 1992.
35. Peter F. Patel-Schneider. A four-valued semantics for terminological logics. Artificial Intelligence, 38:319-351, 1989.
36. R. L. Rivest and R. E. Schapire. Inference of finite automata using homing sequences. Inform. Corn-put, 103(2):299-347, April 1993.
37. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, November 1984.
38. L. G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1, pages 560-566, Los Angeles, California, 1985. International Joint Committee for Artificial Intelligence.