{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:49:04Z","timestamp":1725504544757},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784685"},{"type":"electronic","value":"9783540784692"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78469-2_11","type":"book-chapter","created":{"date-parts":[[2008,2,21]],"date-time":"2008-02-21T23:17:25Z","timestamp":1203635845000},"page":"78-87","source":"Crossref","is-referenced-by-count":1,"title":["ILP :- Just Trie It"],"prefix":"10.1007","author":[{"given":"Rui","family":"Camacho","sequence":"first","affiliation":[]},{"given":"Nuno A.","family":"Fonseca","sequence":"additional","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037089","volume":"8","author":"S. Muggleton","year":"1991","unstructured":"Muggleton, S.: Inductive logic programming. New Generation Computing\u00a08(4), 295\u2013317 (1991)","journal-title":"New Generation Computing"},{"key":"11_CR2","unstructured":"Ilp applications. http:\/\/www.cs.bris.ac.uk\/~ILPnet2\/Applications\/"},{"key":"11_CR3","first-page":"82","volume-title":"Advances in Inductive Logic Programming","author":"C. N\u00e9dellec","year":"1996","unstructured":"N\u00e9dellec, C., Rouveirol, C., Ad\u00e9, H., Bergadano, F., Tausend, B.: Declarative bias in ILP. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 82\u2013103. IOS Press, Amsterdam (1996)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Camacho, R.: Improving the efficiency of ilp systems using an incremental language level search. In: Annual Machine Learning Conference of Belgium and the Netherlands (2002)","DOI":"10.1007\/978-3-540-24580-3_29"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.924","volume":"16","author":"H. Blockeel","year":"2002","unstructured":"Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the efficiency of Inductive Logic Programming through the use of query packs. Journal of Artificial Intelligence Research\u00a016, 135\u2013166 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"11_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44960-4_14","volume-title":"Inductive Logic Programming","author":"V.S. Costa","year":"2000","unstructured":"Costa, V.S., Srinivasan, A., Camacho, R.: A note on two simple transformations for improving the efficiency of an ILP system. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, Springer, Heidelberg (2000)"},{"key":"11_CR7","unstructured":"Costa, V.S., Srinivasan, A., Camacho, R., Hendrik, Van Laer, W.: Query transformations for improving the efficiency of ilp systems. Journal of Machine Learning Research (2002)"},{"key":"11_CR8","unstructured":"Camacho, R.: Inductive Logic Programming to Induce Controllers. In: PhD thesis, Univerity of Porto (2000)"},{"key":"11_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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":"11_CR10","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"},{"issue":"3-4","key":"11_CR11","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":"11_CR12","unstructured":"Aleph, http:\/\/web.comlab.ox.ac.uk\/oucl\/research\/areas\/machlearn\/Aleph\/"},{"key":"11_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/11853886_42","volume-title":"Logics in Artificial Intelligence","author":"N.A. Fonseca","year":"2006","unstructured":"Fonseca, N.A., Silva, F., Camacho, R.: April - An Inductive Logic Programming System. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol.\u00a04160, pp. 481\u2013484. Springer, Heidelberg (2006)"},{"key":"11_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-540-39917-9_10","volume-title":"Inductive Logic Programming","author":"N.A. Fonseca","year":"2003","unstructured":"Fonseca, N.A., Rocha, R., Camacho, R., Silva, F.: Efficient Data Structures for Inductive Logic Programming. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 130\u2013145. Springer, Heidelberg (2003)"},{"key":"11_CR15","unstructured":"Nijssen, S., Kok, J.N.: Faster Association Rules for Multiple Relations. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 891\u2013896 (2001)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3540635149_40","volume-title":"Inductive Logic Programming","author":"L. Dehaspe","year":"1997","unstructured":"Dehaspe, L., De Raedt, L.: Mining Association Rules in Multiple Relations. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 125\u2013132. Springer, Heidelberg (1997)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1962","unstructured":"Fredkin, E.: Trie Memory. Communications of the ACM\u00a03, 490\u2013499 (1962)","journal-title":"Communications of the ACM"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-56610-4_56","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"L. Bachmair","year":"1993","unstructured":"Bachmair, L., Chen, T., Ramakrishnan, I.V.: Associative-Commutative Discrimination Nets. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 61\u201374. Springer, Heidelberg (1993)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Term Indexing","author":"P. Graf","year":"1996","unstructured":"Graf, P.: Term Indexing. In: Graf, P. (ed.) Term Indexing. LNCS, vol.\u00a01053, Springer, Heidelberg (1996)"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"I.V. Ramakrishnan","year":"1999","unstructured":"Ramakrishnan, I.V., Rao, P., Sagonas, K., Swift, T., Warren, D.S.: Efficient Access Mechanisms for Tabled Logic Programs. Journal of Logic Programming\u00a038(1), 31\u201354 (1999)","journal-title":"Journal of Logic Programming"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3540635149_58","volume-title":"Inductive Logic Programming","author":"A. Yamamoto","year":"1997","unstructured":"Yamamoto, A.: Which Hypotheses Can Be Found with Inverse Entailment? In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 296\u2013308. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78469-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:05Z","timestamp":1619507405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78469-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784685","9783540784692"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78469-2_11","relation":{},"subject":[]}}