{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:29:19Z","timestamp":1764700159836,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677956"},{"type":"electronic","value":"9783540449607"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44960-4_8","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:59:31Z","timestamp":1178211571000},"page":"130-146","source":"Crossref","is-referenced-by-count":56,"title":["Theory Completion Using Inverse Entailment"],"prefix":"10.1007","author":[{"given":"Stephen H.","family":"Muggleton","sequence":"first","affiliation":[]},{"given":"Christopher H.","family":"Bryant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"8_CR1","unstructured":"H. Ade, L. De Raedt, and M. Bruynooghe. Theory revision. In S. Muggleton, editor, Proceedings of the 3rd International Workshop on Inductive Logic Programming, pages 179\u2013192, 1993."},{"key":"8_CR2","unstructured":"Y. Dimopoulos and A. Kakas. Abduction and inductive learning. In L. De Raedt, editor, Proceedings of the Fifth Inductive Logic Programming Workshop (ILP9), pages 25\u201328, Leuven, Belgium, 1995. KU Leuven."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0168-9525(96)10027-5","volume":"12","author":"B. Dujon","year":"1996","unstructured":"B. Dujon. The yeast genome project-what did we learn? Trends in Genetics, 12:263\u2013270, 1996.","journal-title":"Trends in Genetics"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"K. Furukawa. On the completion of the most specific hypothesis computation in inverse entailment for mutual recursion. In Proceedings of Discovery Science\u2019 98, LNAI1532, pages 315\u2013325, Berlin, 1998. Springer-Verlag.","DOI":"10.1007\/3-540-49292-5_28"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1126\/science.274.5287.546","volume":"274","author":"A. e. m. al. Goffeau","year":"1996","unstructured":"Goffeau, A. et multi al. Life with 6000 genes. Science, 274:546\u2013567, 1996.","journal-title":"Science"},{"key":"8_CR6","series-title":"LNAI","first-page":"303","volume-title":"Proceedings of Discovery Science\u2019 98","author":"K. Ito","year":"1998","unstructured":"K. Ito and A. Yamamoto. Finding hypotheses from examples by computing the least generlisation of bottom clauses. In S. Arikawa and H. Motoda, editors, Proceedings of Discovery Science\u2019 98, pages 303\u2013314. Springer, Berlin, 1998. LNAI 1532."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2, 1992.","DOI":"10.1093\/logcom\/2.6.719"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245\u2013286, 1995.","journal-title":"New Generation Computing"},{"key":"8_CR9","series-title":"LNAI","first-page":"245","volume-title":"Proceedings of the Eighth International Workshop on Inductive Logic Programming (ILP-98)","author":"S. Muggleton","year":"1998","unstructured":"S. Muggleton. Completing inverse entailment. In C.D. Page, editor, Proceedings of the Eighth International Workshop on Inductive Logic Programming (ILP-98), LNAI 1446, pages 245\u2013249. Springer-Verlag, Berlin, 1998."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1038\/379597a0","volume":"379","author":"S.G. Oliver","year":"1996","unstructured":"S.G. Oliver. From DNA sequence to biological function. Nature, 379:597\u2013600, 1996.","journal-title":"Nature"},{"key":"8_CR11","unstructured":"G. Plotkin. A further note on inductive generalization. In Machine Intelligence, volume 6. Edinburgh University Press, 1971."},{"key":"8_CR12","unstructured":"L. De Raedt. Interactive Theory Revision: an Inductive Logic Programming Approach. Academic Press, 1992."},{"key":"8_CR13","first-page":"107","volume":"8","author":"L. Raedt De","year":"1992","unstructured":"L. De Raedt and M. Bruynooghe. Interactive concept-learning and constructive induction by analogy. Machine Learning, 8:107\u2013150, 1992.","journal-title":"Machine Learning"},{"issue":"2","key":"8_CR14","first-page":"227","volume":"4","author":"L. Raedt De","year":"1996","unstructured":"L. De Raedt and N. Lavrac. Multiple predicate learning in two inductive logic programming settings. Journal on Pure and Applied Logic, 4(2):227\u2013254, 1996.","journal-title":"Journal on Pure and Applied Logic"},{"issue":"2","key":"8_CR15","first-page":"95","volume":"19","author":"B. L. Richards","year":"1995","unstructured":"B. L. Richards and R. J. Mooney. Automated refinement of first-order Horn-clause domain theories. Machine Learning, 19(2):95\u2013131, 1995.","journal-title":"Machine Learning"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"E.Y. Shapiro. Algorithmic program debugging. MIT Press, 1983.","DOI":"10.7551\/mitpress\/1192.001.0001"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"M. Stickel","year":"1988","unstructured":"M. Stickel. A Prolog technology theorem prover: implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4(4):353\u2013380, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"J. Wogulis. Revising relational theories. In Proceedings of the 8th International Workshop on Machine Learning, pages 462\u2013466. Morgan Kaufmann, 1991.","DOI":"10.1016\/B978-1-55860-200-7.50095-7"},{"key":"8_CR19","first-page":"14","volume-title":"Advances in Inductive Logic Programming","author":"S. Wrobel","year":"1995","unstructured":"S. Wrobel. First-order theory refinement. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 14\u201333. IOS Press, Ohmsha, Amsterdam, 1995."},{"key":"8_CR20","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3540635149_58","volume-title":"Proceedings of the Seventh International Workshop on Inductive Logic Programming","author":"A. Yamamoto","year":"1997","unstructured":"A. Yamamoto. Which hypotheses can be found with inverse entailment? In N. Lavra\u010d and S. D\u017eeroski, editors, Proceedings of the Seventh International Workshop on Inductive Logic Programming, pages 296\u2013308. Springer-Verlag, Berlin, 1997. LNAI 1297."}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44960-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:49:21Z","timestamp":1736988561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44960-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677956","9783540449607"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44960-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}