{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:22:32Z","timestamp":1761862952945},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201441"},{"type":"electronic","value":"9783540399179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39917-9_22","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:02:15Z","timestamp":1277697735000},"page":"329-346","source":"Crossref","is-referenced-by-count":9,"title":["Query Optimization in Inductive Logic Programming by Reordering Literals"],"prefix":"10.1007","author":[{"given":"Jan","family":"Struyf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009867806624","volume":"3","author":"H. Blockeel","year":"1999","unstructured":"Blockeel, H., De Raedt, L., Jacobs, N., Demoen, B.: Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery\u00a03(1), 59\u201393 (1999)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"22_CR2","doi-asserted-by":"crossref","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 (2001) (submitted)","DOI":"10.1613\/jair.924"},{"key":"22_CR3","series-title":"Series in Logic Programming","first-page":"40","volume-title":"Proceedings of the 4th International Conference on Logic Programming (ICLP 1987)","author":"M. Carlsson","year":"1987","unstructured":"Carlsson, M.: Freeze, indexing, and other implementation issues in the WAM. In: Lassez, J.-L. (ed.) Proceedings of the 4th International Conference on Logic Programming (ICLP 1987). Series in Logic Programming, pp. 40\u201358. MIT Press, Cambridge (1987)"},{"key":"22_CR4","unstructured":"Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 2nd edn. Benjamin\/Cummings (1989)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Jarke, M., Koch, J.: Query optimization in database systems. ACM Computing Surveys 16(2) (1984)","DOI":"10.1145\/356924.356928"},{"key":"22_CR6","first-page":"130","volume-title":"Proceedings of the 11th International Conference on Machine Learning","author":"J.U. Kietz","year":"1994","unstructured":"Kietz, J.U., L\u00fcbbe, M.: An efficient subsumption algorithm for inductive logic programming. In: Proceedings of the 11th International Conference on Machine Learning, pp. 130\u2013138. Morgan Kaufmann, San Francisco (1994)"},{"key":"22_CR7","unstructured":"Krall, A.: Implementation techniques for prolog. In: Fuchs, N., Gottlob, G. (eds.) Proceedings of the Tenth Logic Programming Workshop, WLP 1994, pp. 1\u201315 (1994)"},{"key":"22_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"issue":"3-4","key":"22_CR9","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":"22_CR10","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"82","volume-title":"Advances in Inductive Logic Programming","author":"C. N\u00e9dellec","year":"1996","unstructured":"N\u00e9dellec, C., Ad\u00e9, H., Bergadano, F., Tausend, B.: Declarative bias in ILP. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming. Frontiers in Artificial Intelligence and Applications, vol.\u00a032, pp. 82\u2013103. IOS Press, Amsterdam (1996)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Pavlov, D., Mannila, H., Smyth, P.: Beyond independence: Probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering (2003) (to appear)","DOI":"10.1109\/TKDE.2003.1245281"},{"key":"22_CR12","first-page":"239","volume":"5","author":"J.R. Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Machine Learning\u00a05, 239\u2013266 (1990)","journal-title":"Machine Learning"},{"key":"22_CR13","unstructured":"Santos Costa, V., 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 (2002) (in press)"},{"key":"22_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-48751-4_27","volume-title":"Inductive Logic Programming","author":"A. Srinivasan","year":"1999","unstructured":"Srinivasan, A., King, R.D., Bristol, D.W.: An assessment of ILP-assisted models for toxicology and the PTE-3 experiment. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 291\u2013302. Springer, Heidelberg (1999)"},{"key":"22_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36468-4_17","volume-title":"Inductive Logic Programming","author":"J. Struyf","year":"2003","unstructured":"Struyf, J., Ramon, J., Blockeel, H.: Compact representation of knowledge bases in ILP. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 254\u2013269. Springer, Heidelberg (2003)"},{"key":"22_CR16","series-title":"Lecture Notes in Artificial Intelligence","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.: 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)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39917-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:34:15Z","timestamp":1559223255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}