{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:31:59Z","timestamp":1740123119204,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T00:00:00Z","timestamp":1481760000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["483448\/2013-3"],"award-info":[{"award-number":["483448\/2013-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10994-016-5595-3","type":"journal-article","created":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T20:13:41Z","timestamp":1481832821000},"page":"197-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the use of stochastic local search techniques to revise first-order logic theories from examples"],"prefix":"10.1007","volume":"106","author":[{"given":"Aline","family":"Paes","sequence":"first","affiliation":[]},{"given":"Gerson","family":"Zaverucha","sequence":"additional","affiliation":[]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ad\u00e9, H., Malfait, B., & De Raedt, L. (1994). RUTH: An ILP theory revision system. In 8th international symposium on methodologies for intelligent systems (ISMIS-94), LNCS (Vol. 869, pp. 336\u2013345). Springer","key":"5595_CR1","DOI":"10.1007\/3-540-58495-1_34"},{"issue":"1\u20132","key":"5595_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H Blockeel","year":"1998","unstructured":"Blockeel, H., & De Raedt, L. (1998). Top-down induction of first-order logical decision trees. Artificial Intelligence, 101(1\u20132), 285\u2013297.","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Bratko, I. (1999). Refining complete hypotheses in ILP. In Proceedings of the 9th inductive logic programming (ILP-99), LNAI (Vol. 1634, pp. 44\u201355) Springer.","key":"5595_CR3","DOI":"10.1007\/3-540-48751-4_6"},{"doi-asserted-by":"crossref","unstructured":"Buntine, W. (1991). Theory refinement on Bayesian networks. In Proceedings of the 17th annual conference on uncertainty in artificial intelligence (UAI-91), San Mateo, CA (pp. 52\u201360).","key":"5595_CR4","DOI":"10.1016\/B978-1-55860-203-8.50010-3"},{"issue":"2","key":"5595_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/507515.507523","volume":"3","author":"J Cheng","year":"2002","unstructured":"Cheng, J., Hatzis, C., Hyashi, H., Krogel, M. A., Morishita, S., Page, D., et al. (2002). KDD Cup 2001 report. SIGKDD Explorations, 3(2), 47\u201364.","journal-title":"SIGKDD Explorations"},{"unstructured":"Chisholm, M., & Tadepalli, P. (2002). Learning decision rules by randomized iterative local search. In Proceedings of the 19th international conference on machine learning (ICML-02) (pp. 75\u201382).","key":"5595_CR6"},{"unstructured":"De Raedt, L., & Bruynooghe, M. (1993). A theory of clausal discovery. In Proceedings of the 13th international joint conference on artificial intelligence (IJCAI-93) (pp 1058\u20131063).","key":"5595_CR7"},{"key":"5595_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10994-008-5079-1","volume":"73","author":"T Dietterich","year":"2008","unstructured":"Dietterich, T., Domingos, P., Getoor, L., Muggleton, S., & Tadepalli, P. (2008). Structured machine learning: The next ten years. Machine Learning, 73, 3\u201323.","journal-title":"Machine Learning"},{"issue":"1","key":"5595_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10994-009-5116-8","volume":"76","author":"AL Duboc","year":"2009","unstructured":"Duboc, A. L., Paes, A., & Zaverucha, G. (2009). Using the bottom clause and modes declarations on FOL theory revision from examples. Machine Learning, 76(1), 73\u2013107.","journal-title":"Machine Learning"},{"unstructured":"Dzeroski, S., & Bratko, I. (1992). Handling noise in inductive logic programming. In Proceedings of the 2nd international workshop on inductive logic programming.","key":"5595_CR10"},{"issue":"1\u20132","key":"5595_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007638124237","volume":"38","author":"F Esposito","year":"2000","unstructured":"Esposito, F., Semeraro, G., Fanizzi, N., & Ferilli, S. (2000). Multistrategy theory revision: Induction and abduction in INTHELEX. Machine Learning, 38(1\u20132), 133\u2013156.","journal-title":"Machine Learning"},{"key":"5595_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/EBK1439826119","volume-title":"Knowledge discovery from data streams","author":"J Gama","year":"2010","unstructured":"Gama, J. (2010). Knowledge discovery from data streams. Boca Raton: CRC Press."},{"doi-asserted-by":"crossref","unstructured":"Gama, J., Medas, P., Castillo, G., & Rodrigues, P. (2004). Learning with drift detection. In Advances in artificial intelligence-SBIA 2004 (pp. 286\u2013295) Springer.","key":"5595_CR13","DOI":"10.1007\/978-3-540-28645-5_29"},{"key":"5595_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1008328630915","volume":"11","author":"A Garcez","year":"1999","unstructured":"Garcez, A., & Zaverucha, G. (1999). The connectionist inductive learning and logic programming system. Applied Intelligence, 11, 59\u201377.","journal-title":"Applied Intelligence"},{"issue":"4","key":"5595_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF00125375","volume":"8","author":"JD Hirst","year":"1994","unstructured":"Hirst, J. D., King, R. D., & Sternberg, M. J. E. (1994). Quantitative structure-activity relationships by neural networks and inductive logic programming. I. The inhibition of dihydrofolate reductase by pyrimidines. Journal of Computer Aided Molecular Design, 8(4), 405\u2013420.","journal-title":"Journal of Computer Aided Molecular Design"},{"key":"5595_CR16","volume-title":"Stochastic local search: Foundations and applications","author":"HH Hoos","year":"2005","unstructured":"Hoos, H. H., & St\u00fctzle, T. (2005). Stochastic local search: Foundations and applications (1st ed.). California: Elsevier.","edition":"1"},{"doi-asserted-by":"crossref","unstructured":"Joshi, S., Ramakrishnan, G., & Srinivasan, A. (2008). Feature construction using theory-guided sampling and randomised search. In Proceedings of the 18th international conference on ILP, LNAI (Vol. 5194, pp. 140\u2013157) Springer.","key":"5595_CR17","DOI":"10.1007\/978-3-540-85928-4_14"},{"issue":"Suppl 3","key":"5595_CR18","doi-asserted-by":"crossref","first-page":"S17","DOI":"10.1186\/1471-2164-10-S3-S17","volume":"10","author":"SR Kadupitige","year":"2009","unstructured":"Kadupitige, S. R., Julia, K. C. L., Sellmeier, S. J., Catchpoole, D. R., Bain, M., & Gaeta, B. A. (2009). MINER: Exploratory analysis of gene interaction networks by machine learning from expression data. BMC Genomics, 10(Suppl 3), S17.","journal-title":"BMC Genomics"},{"issue":"23","key":"5595_CR19","doi-asserted-by":"crossref","first-page":"11,322","DOI":"10.1073\/pnas.89.23.11322","volume":"89","author":"RD King","year":"1992","unstructured":"King, R. D., Muggleton, S., & Sternberg, M. (1992). Drug design by machine learning: The use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase. Proceedings of the National Academy of Sciences, 89(23), 11,322\u201311,326.","journal-title":"Proceedings of the National Academy of Sciences"},{"unstructured":"Kohavi, R. (1995). A study of cross-validation and bootstrap for accuracy estimation and model selection. In Proceedings of the 14th international joint conference on artificial intelligence (IJCAI-95) (pp 1137\u20131145).","key":"5595_CR20"},{"issue":"3\/4","key":"5595_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"RA Kowalski","year":"1971","unstructured":"Kowalski, R. A., & Kuehner, D. (1971). Linear resolution with selection function. Artificial Intelligence, 2(3\/4), 227\u2013260.","journal-title":"Artificial Intelligence"},{"key":"5595_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"J Lloyd","year":"1987","unstructured":"Lloyd, J. (1987). Foundations of logic programming (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"3&4","key":"5595_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, 13(3&4), 245\u2013286.","journal-title":"New Generation Computing"},{"doi-asserted-by":"crossref","unstructured":"Muggleton, S. (2005). Machine learning for systems biology. In Proceedings of the 15th international conference on inductive logic programming (ILP-05), lecture notes in computer science (Vol. 3625, pp. 416\u2013423) Springer.","key":"5595_CR24","DOI":"10.1007\/11536314_27"},{"doi-asserted-by":"crossref","unstructured":"Muggleton, S., & Bryant, C. H. (2000). Theory completion using inverse entailment. In Proceedings of the 10th international conference on ILP, LNAI (Vol. 1866, pp. 130\u2013146) Springer.","key":"5595_CR25","DOI":"10.1007\/3-540-44960-4_8"},{"issue":"2\u20133","key":"5595_CR26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10994-007-5029-3","volume":"70","author":"S Muggleton","year":"2008","unstructured":"Muggleton, S., & Tamaddoni-Nezhad, A. (2008). QG\/GA: A stochastic search for Progol. Machine Learning, 70(2\u20133), 121\u2013133.","journal-title":"Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"Muggleton, S., Paes, A., Costa, V. S., & Zaverucha, G. (2010a). Chess revision: Acquiring the rules of chess variants through FOL theory revision from examples. In Inductive logic programming, 19th international conference, ILP 2009. Revised papers, LNCS (Vol. 5989, pp. 123\u2013130) Springer.","key":"5595_CR27","DOI":"10.1007\/978-3-642-13840-9_12"},{"doi-asserted-by":"crossref","unstructured":"Muggleton, S., Santos, J. C. A., & Tamaddoni-Nezhad, A. (2010b). ProGolem: A system based on relative minimal generalisation. In Proceedings of the 1th international conference on inductive logic programming (ILP-09), LNAI (Vol. 5989, pp. 131\u2013148) Springer.","key":"5595_CR28","DOI":"10.1007\/978-3-642-13840-9_13"},{"issue":"7","key":"5595_CR29","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1093\/protein\/5.7.647","volume":"5","author":"SH Muggleton","year":"1992","unstructured":"Muggleton, S. H., King, R. D., & Sternberg, M. J. E. (1992). Protein secondary structure prediction using logic-based machine learning. Protein Engineering, 5(7), 647\u2013657.","journal-title":"Protein Engineering"},{"doi-asserted-by":"crossref","unstructured":"Paes, A., Revoredo, K., Zaverucha, G., & Santos Costa, V. (2005). Probabilistic first-order theory revision from examples. In Proceedings of the 15th international conference on inductive logic programming (ILP-05), LNAI (Vol. 3625, pp. 295\u2013311) Springer.","key":"5595_CR30","DOI":"10.1007\/11536314_18"},{"unstructured":"Paes, A., \u017delezn\u00fd, F., Zaverucha, G., Page, D., & Srinivasan, A. (2006). ILP through propositionalization and stochastic k-term DNF learning. In Proceedings of the revised papers of 16th international conference on ILP (ILP-06), LNAI (Vol. 4455, pp. 379\u2013393) Springer.","key":"5595_CR31"},{"unstructured":"Paes, A., Zaverucha, G., & Santos Costa, V. (2007). Revising first-order logic theories from examples through stochastic local search. In Proceedings of the 17th international conference on ILP (ILP-07), LNAI (Vol. 4894, pp. 200\u2013210) Springer.","key":"5595_CR32"},{"unstructured":"Paes, A. M. (2011). On the Effective revision of (Bayesian) logic programs from examples. Ph.D. thesis.","key":"5595_CR33"},{"key":"5595_CR34","first-page":"239","volume":"5","author":"J Quinlan","year":"1990","unstructured":"Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266.","journal-title":"Machine Learning"},{"unstructured":"Ramachandran, S., & Mooney, R. (1998). Theory refinement of Bayesian networks with hidden variables. In Proceedings of the 15th international conference on machine learning (ICML-98) (pp. 454\u2013462).","key":"5595_CR35"},{"unstructured":"Richards, B. L., & Mooney, R. J. (1992). Learning relations by pathfinding. In Proceedings of the 10th annual national conference on artificial intelligence (AAAI-92) (pp. 50\u201355).","key":"5595_CR36"},{"issue":"2","key":"5595_CR37","first-page":"95","volume":"19","author":"BL Richards","year":"1995","unstructured":"Richards, B. L., & Mooney, R. J. (1995). Automated refinement of first-order Horn-clause domain theories. Machine Learning, 19(2), 95\u2013131.","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"5595_CR38","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62(1\u20132), 107\u2013136.","journal-title":"Machine Learning"},{"unstructured":"R\u00fcckert, U., & Kramer, S. (2003). Stochastic local search in k-term DNF learning. In Proceedings of the 20th international conference on machine learning (ICML-03) (pp. 648\u2013655).","key":"5595_CR39"},{"doi-asserted-by":"crossref","unstructured":"R\u00fcckert, U., & Kramer, S. (2004). Towards tight bounds for rule learning. In Proceedings of the 21st international conference on machine learning (ICML-04), ACM (Vol.\u00a069).","key":"5595_CR40","DOI":"10.1145\/1015330.1015387"},{"key":"5595_CR41","volume-title":"Artificial intelligence: A modern approach","author":"S Russell","year":"2010","unstructured":"Russell, S., & Norvig, P. (2010). Artificial intelligence: A modern approach (3rd ed.). Englewook Cliffs, NJ: Prentice-Hall.","edition":"3"},{"issue":"Special Issue 1","key":"5595_CR42","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"V Santos Costa","year":"2012","unstructured":"Santos Costa, V., Damas, L., & Rocha, R. (2012). The yap prolog system. Theory and Practice of Logic Programming, 12(Special Issue 1\u20132), 5\u201334.","journal-title":"Theory and Practice of Logic Programming"},{"unstructured":"Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the 10th annual national conference on artificial intelligence (AAAI-92) (pp. 440\u2013446).","key":"5595_CR43"},{"doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H. A., & Cohen, B. (1996). Local search strategies for satisfiability testing. Cliques, coloring, and satisfiability: Second DIMACS implementation challenge, October 11\u201313, 1993. In DIMACS series in discrete mathematics and theoretical computer science (Vol. 26, pp. 521\u2013532).","key":"5595_CR44","DOI":"10.1090\/dimacs\/026\/25"},{"issue":"6","key":"5595_CR45","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1016\/j.ins.2007.10.015","volume":"178","author":"M Serrurier","year":"2008","unstructured":"Serrurier, M., & Prade, H. (2008). Improving inductive logic programming by using simulated annealing. Information Sciences, 178(6), 1423\u20131441.","journal-title":"Information Sciences"},{"unstructured":"Shapiro, E .Y. (1981). The model inference system. In Proceedings of the 7th international joint conference on artificial intelligence (IJCAI-81) (p. 1064) William Kaufmann.","key":"5595_CR46"},{"issue":"1","key":"5595_CR47","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10994-009-5114-x","volume":"76","author":"L Specia","year":"2009","unstructured":"Specia, L., Srinivasan, A., Joshi, S., Ramakrishnan, G., & Nunes, M. D. G. V. (2009). An investigation into feature construction to assist word sense disambiguation. Machine Learning, 76(1), 109\u2013136.","journal-title":"Machine Learning"},{"unstructured":"Srinivasan, A. (2000). A study of two probabilistic methods for searching large spaces with ILP. Tech. Rep. PRG-TR-16-00, Oxford University Computing Laboratory, Oxford.","key":"5595_CR48"},{"unstructured":"Srinivasan, A. (2001). The Aleph Manual. http:\/\/web.comlab.ox.ac.uk\/oucl\/research\/areas\/machlearn\/Aleph\/aleph.html .","key":"5595_CR49"},{"doi-asserted-by":"crossref","unstructured":"Tamaddoni-Nezhad, A., & Muggleton, S. (2000). Searching the subsumption lattice by a genetic algorithm. In Proceedings of the 10th international conference on ILP (ILP-00), LNAI (Vol. 1866, pp. 243\u2013252) Springer.","key":"5595_CR50","DOI":"10.1007\/3-540-44960-4_15"},{"issue":"1\u20132","key":"5595_CR51","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0004-3702(94)90105-8","volume":"70","author":"G Towell","year":"1994","unstructured":"Towell, G., & Shavlik, J. (1994). Knowledge-based artificial neural networks. Artificial Intelligence, 70(1\u20132), 119\u2013165.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"5595_CR52","first-page":"69","volume":"23","author":"G Widmer","year":"1996","unstructured":"Widmer, G., & Kubat, M. (1996). Learning in the presence of concept drift and hidden contexts. Machine Learning, 23(1), 69\u2013101.","journal-title":"Machine Learning"},{"unstructured":"Wogulis, J., & Pazzani, M. (1993). A methodology for evaluationg theory revision systems: Results with Audrey II. In Proceedings of the 13th international joint conference on artificial intelligence (IJCAI-93) (pp. 1128\u20131134).","key":"5595_CR53"},{"issue":"6004","key":"5595_CR54","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1126\/science.1193147","volume":"330","author":"AW Woolley","year":"2010","unstructured":"Woolley, A. W., Chabris, C. F., Pentland, A., Hashmi, N., & Malone, T. W. (2010). Evidence for a collective intelligence factor in the performance of human groups. Science, 330(6004), 686\u2013688.","journal-title":"Science"},{"issue":"1","key":"5595_CR55","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1022674116380","volume":"14","author":"S Wrobel","year":"1994","unstructured":"Wrobel, S. (1994). Concept formation during interactive theory revision. Machine Learning, 14(1), 169\u2013191.","journal-title":"Machine Learning"},{"key":"5595_CR56","first-page":"14","volume-title":"Advances in inductive logic programming","author":"S Wrobel","year":"1996","unstructured":"Wrobel, S. (1996). First-order theory refinement. In L. De Raedt (Ed.), Advances in inductive logic programming (pp. 14\u201333). Netherlands: IOS Press."},{"unstructured":"\u017delezn\u00fd, F., Srinivasan, A., & Page, D. (2002). Lattice-search runtime distributions may be heavy-tailed. In Proceedings of the twelth international conference on inductive logic programming (ILP-02), LNAI (Vol. 2583, pp. 341\u2013358) Springer.","key":"5595_CR57"},{"issue":"1\u20133","key":"5595_CR58","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10994-006-7733-9","volume":"64","author":"F \u017delezn\u00fd","year":"2006","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., & Page, D. (2006). Randomised restarted search in ILP. Machine Learning, 64(1\u20133), 183\u2013208.","journal-title":"Machine Learning"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5595-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-016-5595-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5595-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T12:15:46Z","timestamp":1568636146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-016-5595-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,15]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["5595"],"URL":"https:\/\/doi.org\/10.1007\/s10994-016-5595-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2016,12,15]]}}}