{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:30Z","timestamp":1749124050194},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf00881901","type":"journal-article","created":{"date-parts":[[2004,12,25]],"date-time":"2004-12-25T19:18:27Z","timestamp":1104002307000},"page":"83-113","source":"Crossref","is-referenced-by-count":7,"title":["Bounded-overhead caching for definite-clause theorem proving"],"prefix":"10.1007","volume":"11","author":[{"given":"Alberto","family":"Segre","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Scharstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Astrachan, O. L. and Stickel, M. E., ?Caching and lemmaizing in model elimination theorem provers?, Technical Note 513, SRI International, Menlo Park, Calif. (December 1991).","DOI":"10.1007\/3-540-55602-8_168"},{"key":"CR2","unstructured":"Dietrich, S. W., ?Extension tables: memo relations in logic programming?,Proceedings of the Institute of Electrical and Electronics Engineers Symposium on Logic Programming, San Francisco, pp. 264?273 (1987)."},{"key":"CR3","series-title":"Technical Report","volume-title":"Truth maintenance systems for problem solving","author":"J. Doyle","year":"1978","unstructured":"Doyle, J., ?Truth maintenance systems for problem solving?, Technical Report 419, MIT Artificial Intelligence Laboratory, Cambridge, Mass. (1978)."},{"key":"CR4","volume-title":"All the Right Moves","author":"C. Ebeling","year":"1987","unstructured":"Ebeling, C.,All the Right Moves, MIT Press, Cambridge, Mass. (1987)."},{"key":"CR5","unstructured":"Elkan, C., ?Conspiracy numbers and caching for searching and\/or trees and theorem-proving?,Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, pp. 341?346 (1989)."},{"key":"CR6","unstructured":"Elkan, C., ?Incremental, approximate planning?,Proceedings of the National Conference on Artificial Intelligence, Boston, pp. 145?150 (1990)."},{"issue":"2?3","key":"CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(92)90059-7","volume":"55","author":"M. L. Ginsberg","year":"1992","unstructured":"Ginsberg, M. L. and Harvey, W. D., ?Iterative broadening?,Artificial Intelligence 55(2?3), 367?383 (1992).","journal-title":"Artificial Intelligence"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Green, C., ?Application of theorem proving to problem solving?,Proceedings of the First International Joint Conference on Artificial Intelligence, Washington, D.C., pp. 741?747 (1969).","DOI":"10.21236\/ADA459656"},{"key":"CR9","volume-title":"Computer Architecture: A Quantitative Approach","author":"J. Hennessy","year":"1990","unstructured":"Hennessy, J. and Patterson, D.,Computer Architecture: A Quantitative Approach, Morgan Kaufmann Publishers, San Mateo, Calif. (1990)."},{"issue":"1","key":"CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. Korf","year":"1985","unstructured":"Korf, R., ?Depth-first iterative deepening: an optimal admissible tree search?,Artificial Intelligence 27(1), 97?109 (1985).","journal-title":"Artificial Intelligence"},{"key":"CR11","series-title":"Memo","volume-title":"An outlook on truth maintenance","author":"D. A. McAllester","year":"1980","unstructured":"McAllester, D. A., ?An outlook on truth maintenance?, Memo 551, MIT Artificial Intelligence Laboratory, Cambridge, Mass. (August 1980)."},{"key":"CR12","series-title":"Memo","volume-title":"Reasoning utility package user's manual, version one","author":"D. A. McAllester","year":"1982","unstructured":"McAllester, D. A., ?Reasoning utility package user's manual, version one?, Memo 667, MIT Artificial Intelligence Laboratory, Cambridge, Mass. (April 1982)."},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0004-3702(91)90017-E","volume":"50","author":"D. McDermott","year":"1991","unstructured":"McDermott, D., ?A general framework for reasong maintenance?,Artificial Intelligence 50(3), 289?330 (1991).","journal-title":"Artificial Intelligence"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/218019a0","volume":"218","author":"D. Michie","year":"1968","unstructured":"Michie, D., ??Memo? functions and machine learning?,Nature 218, 19?22 (1968).","journal-title":"Nature"},{"issue":"2?3","key":"CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0004-3702(90)90059-9","volume":"42","author":"S. Minton","year":"1990","unstructured":"Minton, S., ?Quantitative results concerning the utility of explanation-based learning?,Artificial Intelligence 42(2?3), 363?392 (1990).","journal-title":"Artificial Intelligence"},{"key":"CR16","unstructured":"Mostow, J. and Cohen, D., ?Automating program speedup by deciding what to cache?,Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, pp. 165?173 (1985)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00244944","volume":"4","author":"D. Plaisted","year":"1988","unstructured":"Plaisted, D., ?Non-Horn clause logic programming without contrapositives?,J. Automated Reasoning 4, 287?325 (1988).","journal-title":"J. Automated Reasoning"},{"key":"CR18","volume-title":"Explanation-based learning of generalized robot assembly plans","author":"A. M. Segre","year":"1987","unstructured":"Segre, A. M., ?Explanation-based learning of generalized robot assembly plans?, Ph.D. Thesis, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana (1987)."},{"key":"CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1691-6","volume-title":"Machine Learning of Robot Assembly Plans","author":"A. M. Segre","year":"1988","unstructured":"Segre, A. M.,Machine Learning of Robot Assembly Plans, Kluwer Academic Publishers, Hingham, Mass. (1988)."},{"key":"CR20","series-title":"Working Paper","volume-title":"A provably complete family of EBL algorithms","author":"A. M. Segre","year":"1990","unstructured":"Segre, A. M. and Elkan, C., ?A provably complete family of EBL algorithms?, Working Paper, Department of Computer Science, Cornell University, Ithaca, N.Y. (1990)."},{"issue":"2","key":"CR21","first-page":"183","volume":"6","author":"A. M. Segre","year":"1991","unstructured":"Segre, A. M., Elkan, C. and Russell, A., ?Technical note: a critical look at experimental evaluations of EBL?,Machine Learning 6(2), 183?196 (1991).","journal-title":"Machine Learning"},{"key":"CR22","series-title":"Working Paper","volume-title":"A robust methodology for experimental evaluations of speedup learning","author":"A. M. Segre","year":"1991","unstructured":"Segre, A. M., Elkan, C., Gordon, G. and Russell, A., ?A robust methodology for experimental evaluations of speedup learning?, Working Paper, Department of Computer Science, Cornell University, Ithaca, N.Y. (1991)."},{"issue":"1?2","key":"CR23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0921-8890(91)90016-E","volume":"8","author":"A. M. Segre","year":"1991","unstructured":"Segre, A. M., ?Learning how to plan?,Robotics and Autonomous Systems 8(1?2), 93?111 (1991).","journal-title":"Robotics and Autonomous Systems"},{"key":"CR24","volume-title":"Machine Learning: Induction, Analogy, and Discovery","author":"A. M. Segre","year":"1993","unstructured":"Segre, A. M., Elkan, C., Scharstein, D., Gordon, G. and Russell, A., ?Adaptive inference?, inMachine Learning: Induction, Analogy, and Discovery, S. Chipman and A. Meyrowitz (Eds.), Kluwer Academic Publishers, Hingham, Mass. (1993)."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Segre, A. M. and Turney, J., ?SEPIA: a resource-bounded adaptive agent?,Proceedings of the First International Conference on Artificial Intelligence Planning Systems, College Park, Maryland, pp. 303?304 (1992).","DOI":"10.1016\/B978-0-08-049944-4.50054-9"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Segre, A. M., ?On combining multiple speedup techniques?,Proceedings of the Ninth International Machine Learning Conference, Aberdeen, Scotland, pp. 400?405 (1992).","DOI":"10.1016\/B978-1-55860-247-2.50057-7"},{"key":"CR27","volume-title":"Machine Learning Methods for Planning","author":"A. M. Segre","year":"1993","unstructured":"Segre, A. M. and Turney, J., ?Planning, acting, and learning in a dynamic domain?, inMachine Learning Methods for Planning, S. Minton (Ed), Morgan Kaufmann Publishers, San Mateo, Calif. (1993)."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Slate, D. and Atkin, L., ?Chess 4.5 ? The Northwestern University chess program?, inChess Skill in Man and Machine, P. Frey (Ed.), Springer-Verlag, pp. 82?118 (1977).","DOI":"10.1007\/978-3-662-06239-5_4"},{"key":"CR29","series-title":"Technical Report","volume-title":"A computational model of skill acquisition","author":"G. J. Sussman","year":"1973","unstructured":"Sussman, G. J., ?A computational model of skill acquisition?, Technical Report 297, MIT Artificial Intelligence Laboratory, Cambridge, Mass. (1973)."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Tamaki, H. and Sato, T., ?OLD resolution with tabulation?,Third International Conference on Logic Programming, London, pp. 85?97 (1986).","DOI":"10.1007\/3-540-16492-8_66"},{"key":"CR31","unstructured":"Turney, J. and Segre, A. M., ?SEPIA: an experiment in integrated planning and improvisation?,Working Notes of the 1989 American Association for Artificial Intelligence Workshop on Planning and Search, Palo Alto, Calif., pp. 59?63 (1989)."},{"key":"CR32","series-title":"Technical Report","volume-title":"A framework for learning in planning domains with uncertainty","author":"J. Turney","year":"1989","unstructured":"Turney, J. and Segre, A. M., ?A framework for learning in planning domains with uncertainty?, Technical Report 89-1009, Department of Computer Science, Cornell University, Itahaca, N.Y. (1989)."},{"issue":"3","key":"CR33","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/131295.131299","volume":"35","author":"D. S. Warren","year":"1992","unstructured":"Warren, D. S., ?Memoing for logic programs?,Communications of the Association for Computing Machinery 35(3), 94?111 (1992).","journal-title":"Communications of the Association for Computing Machinery"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881901\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T03:28:05Z","timestamp":1682911685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00881901"],"URL":"https:\/\/doi.org\/10.1007\/bf00881901","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}