{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:12Z","timestamp":1725560172974},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281771"},{"type":"electronic","value":"9783540318514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11536314_5","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:45:23Z","timestamp":1279723523000},"page":"69-86","source":"Crossref","is-referenced-by-count":1,"title":["A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment"],"prefix":"10.1007","author":[{"given":"H\u00e9ctor Corrada","family":"Bravo","sequence":"first","affiliation":[]},{"given":"David","family":"Page","sequence":"additional","affiliation":[]},{"given":"Raghu","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"Jude","family":"Shavlik","sequence":"additional","affiliation":[]},{"given":"Vitor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Relational Data Mining","year":"2001","key":"5_CR1","unstructured":"Dzeroski, S., Lavrac, N. (eds.): Relational Data Mining. Springer, New York (2001)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/959242.959246","volume":"5","author":"H. Blockeel","year":"2003","unstructured":"Blockeel, H., Sebag, M.: Scalability and efficiency in multi-relational data mining. SIGKDD Explor. Newsl.\u00a05, 17\u201330 (2003)","journal-title":"SIGKDD Explor. Newsl."},{"key":"5_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-39917-9_22","volume-title":"Inductive Logic Programming","author":"J. Struyf","year":"2003","unstructured":"Struyf, J., Blockeel, H.: Query optimization in inductive logic programming by reordering literals. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 329\u2013346. Springer, Heidelberg (2003)"},{"key":"5_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-30109-7_9","volume-title":"Inductive Logic Programming","author":"J. Bockhorst","year":"2004","unstructured":"Bockhorst, J., Ong, I.M.: FOIL-D: Efficiently scaling FOIL for multi-relational data mining of large datasets. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 63\u201379. Springer, Heidelberg (2004)"},{"key":"5_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. J. Artif. Intell. Res. (JAIR)\u00a016, 135\u2013166 (2002)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"5_CR6","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., Laer, W.V.: 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":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0027314","volume-title":"Inductive Logic Programming","author":"J. Cussens","year":"1998","unstructured":"Cussens, J.: Using prior probabilities and density estimation for relational classification. In: Page, D.L. (ed.) ILP 1998. LNCS, vol.\u00a01446, pp. 106\u2013115. Springer, Heidelberg (1998)"},{"key":"5_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-30109-7_25","volume-title":"Inductive Logic Programming","author":"F. Zelezn\u00fd","year":"2004","unstructured":"Zelezn\u00fd, F., Srinivasan, A., Page, D.: A Monte Carlo study of randomised restarted search in ILP. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 341\u2013358. Springer, Heidelberg (2004)"},{"key":"5_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-30109-7_10","volume-title":"Inductive Logic Programming","author":"F. DiMaio","year":"2004","unstructured":"DiMaio, F., Shavlik, J.W.: Learning an approximation to inductive logic programming clause evaluation. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 80\u201397. Springer, Heidelberg (2004)"},{"key":"5_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30109-7_24","volume-title":"Inductive Logic Programming","author":"C. Vens","year":"2004","unstructured":"Vens, C., Assche, A.V., Blockeel, H., Dzeroski, S.: First order random forests with complex aggregates. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 323\u2013340. Springer, Heidelberg (2004)"},{"key":"5_CR11","unstructured":"Costa, V.S., Page, D., Qazi, M., Cussens, J.: CLP(BN): Constraint logic programming for probabilistic knowledge. In: International Conference on Uncertainty in Artificial Intelligence (2003)"},{"key":"5_CR12","unstructured":"Srivasanan, A.: The Aleph manual. Source code (2004), available at http:\/\/web.comlab.ox.ac.uk\/oucl\/research\/areas\/machlearn\/Aleph\/aleph.html"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1998","unstructured":"Muggleton, S.: Inverse entailment and Progol. New Generation Comput.\u00a013, 245\u2013286 (1998)","journal-title":"New Generation Comput."},{"key":"5_CR14","volume-title":"Database Management Systems","author":"R. Ramakrishnan","year":"2003","unstructured":"Ramakrishnan, R., Gehrke, J.: Database Management Systems, 3rd edn. McGraw-Hill, New York (2003)","edition":"3"},{"key":"5_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-39592-8_53","volume-title":"Foundations of Intelligent Systems","author":"S. Ferilli","year":"2003","unstructured":"Ferilli, S., Mauro, N.D., Basile, T.M.A., Esposito, F.: Theta-subsumption and resolution: A new algorithm. In: Zhong, N., Ra\u015b, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol.\u00a02871, pp. 384\u2013391. Springer, Heidelberg (2003)"},{"key":"5_CR16","unstructured":"Mauro, N.D., Basile, T.M.A., Ferilli, S., Esposito, F., Fanizzi, N.: An exhaustive matching procedure for the improvement of learning efficiency. In: [24], pp. 112\u2013129"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/B:MACH.0000023150.80092.40","volume":"55","author":"J. Maloberti","year":"2004","unstructured":"Maloberti, J., Sebag, M.: Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning\u00a055, 137\u2013174 (2004)","journal-title":"Machine Learning"},{"key":"5_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30109-7_7","volume-title":"Inductive Logic Programming","author":"M. Arias","year":"2004","unstructured":"Arias, M., Khardon, R.: Bottom-up ilp using large refinement steps. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 26\u201343. Springer, Heidelberg (2004)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Fonseca, N., Rocha, R., Camacho, R., Silva, F.M.A.: Efficient data structures for inductive logic programming. In: [24] pp.130\u2013145","DOI":"10.1007\/978-3-540-39917-9_10"},{"key":"5_CR20","first-page":"399","volume-title":"ICDE","author":"X. Yin","year":"2004","unstructured":"Yin, X., Han, J., Yang, J., Yu, P.S.: Crossmine: Efficient classification across multiple database relations. In: ICDE, pp. 399\u2013411. IEEE Computer Society, Los Alamitos (2004)"},{"key":"5_CR21","volume-title":"Computer Systems and Software Engineering: State-Of-The-Art","author":"R. Ramakrishnan","year":"1992","unstructured":"Ramakrishnan, R., Srivastava, S., Sudarshan, S.: Efficient bottom-up evaluation of logic programs. In: Dewilde, P., Vandewalle, J. (eds.) Computer Systems and Software Engineering: State-Of-The-Art. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"5_CR22","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of frequent datalog patterns. Data Min. Knowl. Discov.\u00a03, 7\u201336 (1999)","journal-title":"Data Min. Knowl. Discov."},{"key":"5_CR24","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Inductive Logic Programming","year":"2003","unstructured":"Horv\u00e1th, T., Yamamoto, A. (eds.): ILP 2003. LNCS (LNAI), vol.\u00a02835. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11536314_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:42Z","timestamp":1605625902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11536314_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281771","9783540318514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11536314_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}