ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Corrigendum for "learnability of description logics"
Full text PdfPdf (35 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the eighth annual conference on Computational learning theory table of contents
Santa Cruz, California, United States
Page: 463  
Year of Publication: 1995
ISBN:0-89791-723-5
Authors
William W. Cohen  AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Haym Hirsh  Department of Computer Science, Rutgers University, Piscataway, NJ
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
University of California : University of California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Citation Count: 2
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/225298.372773
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
William W. Cohen , Haym Hirsh, Learnability of description logics, Proceedings of the fifth annual workshop on Computational learning theory, p.116-127, July 27-29, 1992, Pittsburgh, Pennsylvania, United States  [doi>10.1145/130385.130398]
2
Michael Frazier , Leonard Pitt, CLASSIC learning, Proceedings of the seventh annual conference on Computational learning theory, p.23-34, July 12-15, 1994, New Brunswick, New Jersey, United States  [doi>10.1145/180139.174994]

CITED BY  2
William W. Cohen, The dual DFA learning problem (extended abstract): hardness results for programming by demonstration and learning first-order representations, Proceedings of the ninth annual conference on Computational learning theory, p.29-40, June 28-July 01, 1996, Desenzano del Garda, Italy
William W. Cohen, Hardness Results for Learning First-Order Representations and Programming by Demonstration, Machine Learning, v.30 n.1, p.57-87, Jan. 1998
Collaborative Colleagues:
William W. Cohen: colleagues
Haym Hirsh: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player