{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T01:45:14Z","timestamp":1714873514817},"reference-count":8,"publisher":"Elsevier","isbn-type":[{"value":"9781558602472","type":"print"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1016\/b978-1-55860-247-2.50057-7","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T02:52:41Z","timestamp":1404183161000},"page":"400-405","source":"Crossref","is-referenced-by-count":1,"title":["On Combining Multiple Speedup Techniques"],"prefix":"10.1016","author":[{"given":"Alberto Maria","family":"Segre","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib1","unstructured":"C. Elkan (1989), \u201cConspiracy Numbers and Caching for Searching And\/Or Trees and Theorem-Proving,\u201d Proceedings of the Eleventh International Joint Conference on AI, Detroit, MI, pp. 341\u2013346."},{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib2","unstructured":"S. Minton (1988), \u201cQuantitative Results Concerning the Utility of Explanation-Based Learning,\u201d Proceedings of the National Conference on AI, St. Paul, MN, pp. 564\u2013569."},{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib3","unstructured":"A. E. Prieditis and J. Mostow (1987), \u201cPROLEARN: Towards a Prolog Interpreter that Learns,\u201d Proceedings of the National Conference on AI, Seattle, WA, pp. 494\u2013498."},{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib4","series-title":"\u201cA Provably Complete Family of EBL Algorithms,\u201d","author":"Segre","year":"1990"},{"issue":"2","key":"10.1016\/B978-1-55860-247-2.50057-7_bib5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00114163","article-title":"\u201cA Critical Look at Experimental Evaluations of EBL,\u201d","volume":"6","author":"Segre","year":"1991","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib6","series-title":"\u201cA Robust Methodology for Experimental Evaluations of Speedup Learning,\u201d","author":"Segre","year":"1991"},{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib7","series-title":"\u201cPractical Caching for Definite- Clause Theorem Proving,\u201d","author":"Segre","year":"1991"},{"key":"10.1016\/B978-1-55860-247-2.50057-7_bib8","series-title":"Machine Learning: Induction, Analogy, and Discovery","article-title":"\u201cAdaptive Inference,\u201d","author":"Segre","year":"1992"}],"container-title":["Machine Learning Proceedings 1992"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558602472500577?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558602472500577?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T07:59:29Z","timestamp":1538467169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558602472500577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9781558602472"],"references-count":8,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-247-2.50057-7","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}