{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:10:02Z","timestamp":1736028602686,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292425"},{"type":"electronic","value":"9783540316961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564089_25","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T13:51:09Z","timestamp":1128952269000},"page":"312-326","source":"Crossref","is-referenced-by-count":0,"title":["A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data"],"prefix":"10.1007","author":[{"given":"M. R. K. Krishna","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedreschi, D.: Reasoning about termination of pure Prolog programs. Information and Computation\u00a0106, 109\u2013157 (1993)","journal-title":"Information and Computation"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","first-page":"649","volume-title":"STACS 94","author":"H. Arimura","year":"1994","unstructured":"Arimura, H., Shinohara, T., Otsuki, S.: In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 649\u2013660. Springer, Heidelberg (1994)"},{"key":"25_CR4","first-page":"365","volume-title":"Proc. Information Modelling and Knowledge Bases V","author":"H. Arimura","year":"1994","unstructured":"Arimura, H., Shinohara, T.: Inductive inference of Prolog programs with linear data dependency from positive data. In: Proc. Information Modelling and Knowledge Bases V, pp. 365\u2013375. IOS press, Amsterdam (1994)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Towards a mathematical theory of inductive inference. Information and Control\u00a028, 125\u2013155 (1975)","journal-title":"Information and Control"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00271-6","volume":"241","author":"M.R.K. Krishna Rao","year":"2000","unstructured":"Krishna Rao, M.R.K.: Some classes of Prolog programs inferable from positive data. Theor. Comput. Sci.\u00a0241, 211\u2013234 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-30215-5_7","volume-title":"Algorithmic Learning Theory","author":"M.R.K. Krishna Rao","year":"2004","unstructured":"Krishna Rao, M.R.K.: Inductive inference of term rewriting systems from positive data. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol.\u00a03244, pp. 69\u201382. Springer, Heidelberg (2004)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","first-page":"243","volume-title":"Static Analysis","author":"M.R.K. Krishna Rao","year":"1995","unstructured":"Krishna Rao, M.R.K., Shyamasundar, R.K.: Unification-free execution of well-moded Prolog programs. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, pp. 243\u2013260. Springer, Heidelberg (1995)"},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)"},{"key":"25_CR11","unstructured":"Martin, E.: Personal communication (2005)"},{"key":"25_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-48751-4_19","volume-title":"Inductive Logic Programming","author":"\u00c9. Martin","year":"1999","unstructured":"Martin, \u00c9., Sharma, A.: On sufficient conditions for learnability of logic programs from positive data. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 198\u2013209. Springer, Heidelberg (1999)"},{"key":"25_CR13","unstructured":"Shapiro, E.: Inductive inference of theories from facts, Tech. Rep., Yale Univ. (1981)"},{"key":"25_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"Shinohara, T.: Inductive inference of monotonic formal systems from positive data. New Generation Computing\u00a08, 371\u2013384 (1991)","journal-title":"New Generation Computing"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(99)00270-4","volume":"241","author":"T. Shinohara","year":"2000","unstructured":"Shinohara, T., Arimura, H.: Inductive inference of unbounded unions of pattern languages from positive data. Theor. Comput. Sci.\u00a0241, 191\u2013209 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR17","volume-title":"The Art of Prolog","author":"L. Sterling","year":"1994","unstructured":"Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564089_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T21:43:17Z","timestamp":1736026997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564089_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292425","9783540316961"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11564089_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}