{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:48:38Z","timestamp":1725896918717},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_30","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:56:20Z","timestamp":1342832180000},"page":"358-372","source":"Crossref","is-referenced-by-count":0,"title":["Projection-Based PILP: Computational Learning Theory with Empirical Results"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Watanabe","sequence":"first","affiliation":[]},{"given":"Stephen H.","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.: A general lower bound on the number of examples needed for learning. Informution and Computation\u00a082, 247\u2013261 (1989)","journal-title":"Informution and Computation"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","volume":"48","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Schapire, R.E.: Efficient distribution-free learning of probabilistic concepts. J. Comput. Syst. Sci.\u00a048, 464\u2013497 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR3","unstructured":"Mitchell, T.M.: Machine learning. McGraw-Hill (1997)"},{"key":"30_CR4","unstructured":"Muggleton, S., David Page Jr., C.: A learnability model for universal representations. In: Proceedings of the 4th International Workshop of Inductive Logic Programming, pp. 139\u2013160. GMD (1997)"},{"key":"30_CR5","first-page":"153","volume":"5","author":"G. Plotkin","year":"1970","unstructured":"Plotkin, G.: A note on inductive genralization. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"30_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-30215-5_3","volume-title":"Algorithmic Learning Theory","author":"L. Raedt De","year":"2004","unstructured":"De Raedt, L., Kersting, K.: Probabilistic Inductive Logic Programming. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol.\u00a03244, pp. 19\u201336. Springer, Heidelberg (2004)"},{"key":"30_CR7","unstructured":"Russell, S.J., Norvig, P.: Artifical intelligence: A modern approach, 2nd edn. Prentice Hall (2003)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-13840-9_24","volume-title":"Inductive Logic Programming","author":"H. Watanabe","year":"2010","unstructured":"Watanabe, H., Muggleton, S.: Can ILP Be Applied to Large Datasets? In: De Raedt, L. (ed.) ILP 2009. LNCS, vol.\u00a05989, pp. 249\u2013256. Springer, Heidelberg (2010)"},{"issue":"1,2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.09.003","volume":"2348","author":"O. Watanabe","year":"2005","unstructured":"Watanabe, O.: Sequential sampling techniques for algorithmic learning theory. Theoretical Computer Science\u00a02348(1,2), 3\u201314 (2005)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31951-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:52:04Z","timestamp":1620129124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}