{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:27:14Z","timestamp":1763036834179,"version":"3.45.0"},"reference-count":5,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9781558602007"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-90-J-1542"],"award-info":[{"award-number":["N00014-90-J-1542"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/b978-1-55860-200-7.50102-1","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T06:11:16Z","timestamp":1404108676000},"page":"500-504","source":"Crossref","is-referenced-by-count":3,"title":["Incremental Refinement of Approximate Domain Theories"],"prefix":"10.1016","author":[{"given":"Ronen","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Segre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Koppel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-200-7.50102-1_bib1","unstructured":"S. Craw and D. Sleeman. Automating the refinement of knowledge-based systems. In Proc. of the 9 th ECAI, pages 167\u2013172, Stockholm, 1990."},{"key":"10.1016\/B978-1-55860-200-7.50102-1_bib2","doi-asserted-by":"crossref","unstructured":"R. Feldman, A. M. Segre, and M. Koppel. Incremental refinement of approximate domain theories\u2013extended version. Technical report, Cornell University, Computer Science Department, 1991.","DOI":"10.1016\/B978-1-55860-200-7.50102-1"},{"key":"10.1016\/B978-1-55860-200-7.50102-1_bib3","unstructured":"D. Ourston and R. J. Mooney. Changing the rules: A comprehensive approach to theory refinement. In Proc. of AAAI-90, pages 815\u2013820, Boston, MA, 1990."},{"year":"1990","series-title":"Termination Proofs for Logic Programs, LNCS 446","author":"Plumer","key":"10.1016\/B978-1-55860-200-7.50102-1_bib4"},{"key":"10.1016\/B978-1-55860-200-7.50102-1_bib5","unstructured":"M. E. Stickel. A method for abductive reasoning in natural-language interpretation. In 1990 Spring Symposium On Automated Abduction, pages 95\u2013103, Stanford, CA, 1990."}],"container-title":["Machine Learning Proceedings 1991"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558602007501021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558602007501021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T09:58:38Z","timestamp":1763027918000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558602007501021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9781558602007"],"references-count":5,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-200-7.50102-1","relation":{},"subject":[],"published":{"date-parts":[[1991]]}}}