{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:39Z","timestamp":1725455739865},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647386"},{"type":"electronic","value":"9783540690597"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0027323","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T08:01:00Z","timestamp":1132387260000},"page":"195-204","source":"Crossref","is-referenced-by-count":1,"title":["Function-free Horn clauses are hard to approximate"],"prefix":"10.1007","author":[{"given":"Richard","family":"Nock","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Jappy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,18]]},"reference":[{"key":"20_CR1","unstructured":"S. Arora. Probabilistic checking of proofs and hardness of approximation problems. Technical Report CS-TR-476-94, Princeton University, 1994."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W. Buntine","year":"1988","unstructured":"W. Buntine. Generalized subsumption and its applications to induction and redundancy. Artificial Intelligence, 36:149\u2013176, 1988.","journal-title":"Artificial Intelligence"},{"key":"20_CR3","unstructured":"W.W. Cohen. Pac-learning nondeterminate clauses. In Proceedings of the Twelfth National Conference on Artificial Intelligence, AAAI'94, pages 676\u2013681, 1994."},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1613\/jair.97","volume":"2","author":"W.W. Cohen","year":"1995","unstructured":"W.W. Cohen. Pac-learning recursive logic programs: Efficient algorithms. Journal of Artificial Intelligence Research, 2:501\u2013539, 1995.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1613\/jair.1917","volume":"2","author":"W.W. Cohen","year":"1995","unstructured":"W.W. Cohen. Pac-learning recursive logic programs: Negative results. Journal of Artificial Intelligence Research, 2:541\u2013571, 1995.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"S. Dzerovski, S.H. Muggleton, and S. Russel. Pac-learnability of determinate logic programs. In Proceedings of COLT-92, pages 128\u2013137, 1992.","DOI":"10.1145\/130385.130399"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold. Language indentification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"K-U. H\u00f6ffgen and H.U. Simon. Robust trainability of single neurons. In Proc. of the 5 th International Conference on Computational Theory, 1992.","DOI":"10.1145\/130385.130431"},{"key":"20_CR9","unstructured":"P. Jappy, R. Nock, and O. Gascuel. Negative robust learning results for horn clause programs. In Proceedings of ICML'96, pages 258\u2013265, 1996."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"M. Kearns, M. Li, L. Pitt, and L.G. Valiant. On the learnability of boolean for-mulae. In Proceedings of STOCS'87, pages 285\u2013294, 1987.","DOI":"10.1145\/28395.28426"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/181668.181674","volume":"5","author":"J.U. Kietz","year":"1994","unstructured":"J.U. Kietz and S. Dzeroski. Inductive logic programming and learnability. Sigart Bulletin, 5:22\u201332, 1994.","journal-title":"Sigart Bulletin"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"S.H. Muggleton. Bayesian inductive logic programming. In Proceedings of the Seventh Workshop on COmputational Learning Theory, 1994.","DOI":"10.1145\/180139.178095"},{"key":"20_CR13","volume-title":"Efficient induction of logic programs. Inductive Logic Programming","author":"S.H. Muggleton","year":"1992","unstructured":"S.H. Muggleton and C. Feng. Efficient induction of logic programs. Inductive Logic Programming. Academic Press, New York, 1992."},{"key":"20_CR14","unstructured":"R. Nock and P. Jappy. On the hardness of approximating function-free horn clauses. Technical Report LIRMM-RR-98017, LIRMM, 1998."},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant. A theory of the learnable. Association for Computing Machinery Communications, 27:1134\u20131142, 1984.","journal-title":"Association for Computing Machinery Communications"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T13:14:29Z","timestamp":1554556469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647386","9783540690597"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0027323","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}