{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:15Z","timestamp":1725566115611},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229414"},{"type":"electronic","value":"9783540301097"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30109-7_7","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T14:21:49Z","timestamp":1284646909000},"page":"26-43","source":"Crossref","is-referenced-by-count":2,"title":["Bottom-Up ILP Using Large Refinement Steps"],"prefix":"10.1007","author":[{"given":"Marta","family":"Arias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roni","family":"Khardon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"35","volume-title":"Proceedings of the International Conference on Machine Learning","author":"J.A. Bianchetti","year":"2002","unstructured":"Bianchetti, J.A., Rouveirol, C., Sebag, M.: Constraint-based learning of long relational concepts. In: Proceedings of the International Conference on Machine Learning, pp. 35\u201342. Morgan Kaufmann, San Francisco (2002)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3540635149_36","volume-title":"Inductive Logic Programming","author":"H. Blockeel","year":"1997","unstructured":"Blockeel, H., De Raedt, L.: Lookahead and discretization in ilp. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 77\u201384. Springer, Heidelberg (1997)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H. Blockeel","year":"1998","unstructured":"Blockeel, H., De Raedt, L.: Top down induction of first order logical decision trees. Artificial Intelligence\u00a0101, 285\u2013297 (1998)","journal-title":"Artificial Intelligence"},{"issue":"11","key":"7_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/219717.219771","volume":"38","author":"I. Bratko","year":"1995","unstructured":"Bratko, I., Muggleton, S.: Applications of inductive logic programming. Communications of the ACM\u00a038(11), 65\u201370 (1995)","journal-title":"Communications of the ACM"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. Raedt De","year":"1997","unstructured":"De Raedt, L.: Logical settings for concept learning. Artificial Intelligence\u00a095(1), 187\u2013201 (1997) ;See also relevant Errata (forthcoming)","journal-title":"Artificial Intelligence"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"70","author":"L. Raedt De","year":"1994","unstructured":"De Raedt, L., Dzeroski, S.: First order jk-clausal theories are PAC-learnable. Artificial Intelligence\u00a070, 375\u2013392 (1994)","journal-title":"Artificial Intelligence"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Learning Theory","author":"L. Raedt De","year":"1995","unstructured":"De Raedt, L., Van Laer, W.: Inductive constraint logic. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS, vol.\u00a0997, Springer, Heidelberg (1995)"},{"key":"7_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-39917-9_9","volume-title":"Inductive Logic Programming","author":"N. Mauro Di","year":"2003","unstructured":"Di Mauro, N., Basile, T.M.A., Ferilli, S., Esposito, F., Fanizzi, N.: An exhaustive matching procedure for the improvement of learning efficiency. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 112\u2013129. Springer, Heidelberg (2003)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dougherty, J., Kohavi, R., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: International Conference on Machine Learning, pp. 194\u2013202 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"7_CR10","unstructured":"Fayyad, U.M., Irani, K.B.: Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of the International Conference on Machine Learning, Amherst, MA, pp. 1022\u20131027 (1993)"},{"key":"7_CR11","first-page":"431","volume":"4","author":"A. Giordana","year":"2003","unstructured":"Giordana, A., Saitta, L., Sebag, M., Botta, M.: Relational learning as search in a critical region. Journal of Machine Learning Research\u00a04, 431\u2013463 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1007610422992","volume":"37","author":"R. Khardon","year":"1999","unstructured":"Khardon, R.: Learning function free Horn expressions. Machine Learning\u00a037, 241\u2013275 (1999)","journal-title":"Machine Learning"},{"key":"7_CR13","first-page":"471","volume-title":"Proceedings of the International Conference on Machine Learning","author":"R. Khardon","year":"2000","unstructured":"Khardon, R.: Learning horn expressions with LogAn-H. In: Proceedings of the International Conference on Machine Learning, pp. 471\u2013478. Morgan Kaufmann, San Francisco (2000)"},{"key":"7_CR14","unstructured":"Kietz, J.-U., L\u00fcbbe, M.: An efficient subsumption algorithm for inductive logic programming. In: Wrobel, S. (ed.) Proceedings of the 4th International Workshop on Inductive Logic Programming Gesellschaft f\u00fcr Mathematik und Datenverarbeitung MBH, vol.\u00a0237, pp. 97\u2013106 (1994)"},{"key":"7_CR15","unstructured":"Van Laer, W., Blockeel, H., De Raedt, L.: Inductive constraint logic and the mutagenesis problem. In: Proceedings of the Eighth Dutch Conference on Artificial Intelligence, pp. 265\u2013276 (November 1996)"},{"key":"7_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44797-0_14","volume-title":"Inductive Logic Programming","author":"J. Maloberti","year":"2001","unstructured":"Maloberti, J., Sebag, M.: Theta-subsumption in a constraint satisfaction perspective. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 164\u2013178. Springer, Heidelberg (2001)"},{"key":"7_CR17","volume-title":"Machine Learning","author":"T. Mitchell","year":"1997","unstructured":"Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)"},{"issue":"3-4","key":"7_CR18","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":"7_CR19","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"1992","unstructured":"Muggleton, S., Buntine, W.: Machine invention of first order predicates by inverting resolution. In: Muggleton, S. (ed.) Inductive Logic Programming, Academic Press, London (1992)"},{"key":"7_CR20","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., DeRaedt, L.: Inductive logic programming: Theory and methods. The Journal of Logic Programming\u00a019&20, 629\u2013680 (1994)","journal-title":"The Journal of Logic Programming"},{"key":"7_CR21","first-page":"281","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"1992","unstructured":"Muggleton, S., Feng, C.: Efficient induction of logic programs. In: Muggleton, S. (ed.) Inductive Logic Programming, pp. 281\u2013298. Academic Press, London (1992)"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/B978-1-55860-036-2.50037-0","volume-title":"Proc. Sixth International Workshop on Machine Learning","author":"S.H. Muggleton","year":"1989","unstructured":"Muggleton, S.H., Bain, M., Hayes-Michie, J., Michie, D.: An experimental comparison of human and machine learning formalisms. In: Proc. Sixth International Workshop on Machine Learning, pp. 113\u2013118. Morgan Kaufmann, San Mateo (1989)"},{"key":"7_CR23","first-page":"12","volume-title":"Proceedings of the 16th Annual ACM Symposium on Principles of Database Systems","author":"C.H. Papadimitriou","year":"1997","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries (extended abstract). In: Proceedings of the 16th Annual ACM Symposium on Principles of Database Systems, pp. 12\u201319. ACM Press, New York (1997)"},{"key":"7_CR24","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"7_CR25","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":"7_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007629922420","volume":"38","author":"M. Sebag","year":"2000","unstructured":"Sebag, M., Rouveirol, C.: Resource-bounded relational reasoning: Induction and deduction through stochastic matching. Machine Learning\u00a038, 41\u201362 (2000)","journal-title":"Machine Learning"},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1090\/dimacs\/026\/25","volume-title":"Cliques, Coloring, and Satisfiability: the Second DIMACS Implementation Challenge","author":"B. Selman","year":"1996","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Cliques, Coloring, and Satisfiability: the Second DIMACS Implementation Challenge, vol.\u00a026, pp. 521\u2013532. American Mathematical Society, Providence (1996)"},{"key":"7_CR28","unstructured":"Srinivasan, A., Muggleton, S., King, R.D.: Comparing the use of background knowledge by inductive logic programming systems. In: Proceedings of the 5th International Workshop on Inductive Logic Programming, pp. 199\u2013230 (1995)"},{"key":"7_CR29","unstructured":"Srinivasan, A., Muggleton, S.H., King, R.D., Sternberg, M.J.E.: Mutagenesis: ILP experiments in a non-determinate biological domain. In: Wrobel, S. (ed.) Proc. 4th Int. Workshop on Inductive Logic Programming, pp. 217\u2013232 (September 1994)"}],"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-30109-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:45:47Z","timestamp":1619999147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30109-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229414","9783540301097"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30109-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}