{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:58Z","timestamp":1725470758045},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540396253"},{"type":"electronic","value":"9783540396277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11853886_42","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T12:40:30Z","timestamp":1158151230000},"page":"481-484","source":"Crossref","is-referenced-by-count":12,"title":["April \u2013 An Inductive Logic Programming System"],"prefix":"10.1007","author":[{"given":"Nuno A.","family":"Fonseca","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Camacho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1162\/153244304773936027","volume":"4","author":"V.S. Costa","year":"2003","unstructured":"Costa, V.S., Srinivasan, A., Camacho, R., Blockeel, H., Demoen, B., Janssens, G., Struyf, J., Vandecasteele, H., Van Laer, W.: Query transformations for improving the efficiency of ilp systems. Journal of Machine Learning Research\u00a04, 465\u2013491 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"42_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-36468-4_22","volume-title":"Inductive Logic Programming","author":"F. \u017delezn\u00fd","year":"2003","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., Page, D.L.: Lattice-search runtime distributions may be heavy-tailed. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 333\u2013345. Springer, Heidelberg (2003)"},{"key":"42_CR3","unstructured":"Cussens, J.: Part-of-speech disambiguation using ilp. Technical Report PRG-TR-25-96, Oxford University Computing Laboratory (1996)"},{"key":"42_CR4","unstructured":"Camacho, R.: As lazy as it can be. In: The Eighth Scandinavian Conference on Artificial Intelligence (SCAI 2003), Bergen, Norway, pp. 47\u201358 (November 2003)"},{"key":"42_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/11564096_72","volume-title":"Machine Learning: ECML 2005","author":"R. Rocha","year":"2005","unstructured":"Rocha, R., Fonseca, N.A., Santos Costa, V.: On Applying Tabling to Inductive Logic Programming. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol.\u00a03720, pp. 707\u2013714. Springer, Heidelberg (2005)"},{"key":"42_CR6","volume-title":"Proceedings of 2005 IEEE International Conference on Cluster Computing","author":"N.A. Fonseca","year":"2005","unstructured":"Fonseca, N.A., Silva, F., Santos Costa, V., Camacho, R.: A pipelined data-parallel algorithm for ILP. In: Proceedings of 2005 IEEE International Conference on Cluster Computing. IEEE, Los Alamitos (2005)"},{"key":"42_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11536314_9","volume-title":"Inductive Logic Programming","author":"N.A. Fonseca","year":"2005","unstructured":"Fonseca, N.A., Silva, F., Camacho, R.: Strategies to parallelize ILP systems. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol.\u00a03625, pp. 136\u2013153. Springer, Heidelberg (2005)"},{"issue":"3-4","key":"42_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming\u00a013(3-4), 245\u2013286 (1995)","journal-title":"New Generation Computing, Special issue on Inductive Logic Programming"},{"key":"42_CR9","first-page":"189","volume-title":"Discovery of relational association rules","author":"L. Dehaspe","year":"2000","unstructured":"Dehaspe, L., Toironen, H.: Relational Data Mining. In: Discovery of relational association rules, pp. 189\u2013208. Springer, Heidelberg (2000)"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\/20","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming\u00a019\/20, 629\u2013679 (1994)","journal-title":"Journal of Logic Programming"},{"key":"42_CR11","unstructured":"Davies, T., Russell, S.: A logical approach to reasoning by analogy. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence, Los Altos, California, pp. 264\u2013270 (1987)"},{"key":"42_CR12","unstructured":"Srinivasan, A.: The Aleph Manual (2003)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11853886_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T02:29:58Z","timestamp":1552271398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11853886_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540396253","9783540396277"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11853886_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}