{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:14:01Z","timestamp":1752228841816},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf03037409","type":"journal-article","created":{"date-parts":[[2009,4,23]],"date-time":"2009-04-23T22:40:55Z","timestamp":1240526455000},"page":"305-319","source":"Crossref","is-referenced-by-count":6,"title":["Logic program forms"],"prefix":"10.1007","volume":"4","author":[{"given":"Takashi","family":"Yokomori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"No. 1","key":"BF03037409_CR1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. M. Burstall","year":"1977","unstructured":"Burstall, R. M. and Darlington, J., \u201cA Transformation System for Developing Recursive Programs,\u201dJ. of ACM, Vol. 24, No. 1, pp. 44\u201367, 1977.","journal-title":"J. of ACM"},{"key":"BF03037409_CR2","series-title":"Internal publication","volume-title":"Les systemes-Q ou un formalisme pour analyser et synthetiser des phrases sur ordinateur","author":"A. Colmerauer","year":"1970","unstructured":"Colmerauer, A., \u201cLes systemes-Q ou un formalisme pour analyser et synthetiser des phrases sur ordinateur,\u201dInternal publication, No. 43, Department d\u2019Informatique, Universite de Montreal, Canada, September 1970."},{"key":"BF03037409_CR3","first-page":"86","volume":"11","author":"A. Cremers","year":"1975","unstructured":"Cremers, A. and Ginsburg, S., \u201cContext-free grammar forms,\u201dJCSS, 11 pp. 86\u2013117, 1975.","journal-title":"JCSS"},{"key":"BF03037409_CR4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden van","year":"1984","unstructured":"van Emden, M. H. and Kowalski, R. A., \u201cThe semantics of Predicate Logic as a Programming Language,\u201dJ. of ACM, Vol. 23, pp. 733\u2013742, 1984.","journal-title":"J. of ACM"},{"key":"BF03037409_CR5","doi-asserted-by":"crossref","unstructured":"Gallaire, H. and Minker, J. (eds.),Logic and Data Bases, Plenum Press, 1978.","DOI":"10.1007\/978-1-4684-3384-5"},{"key":"BF03037409_CR6","doi-asserted-by":"crossref","unstructured":"Greiner, R., \u201cLearning by Understanding Analogies,\u201dA Dissertation paper, Dept. of Computer Science, Stanford Univ., September, 1985.","DOI":"10.1007\/978-1-4613-2279-5_19"},{"key":"BF03037409_CR7","doi-asserted-by":"crossref","unstructured":"Haraguchi, M. and Arikawa, S., \u201cA Foundation of Reasoning by Analogy: Analogical Union of Logic Programs,\u201d inProc. of Logic Programming Conf. \u201986, ICOT, June, 1986.","DOI":"10.1007\/3-540-18024-9_22"},{"key":"BF03037409_CR8","unstructured":"Harrison, M. A.,Introduction to Formal Language Theory, Addison-Wesley, 1978."},{"key":"BF03037409_CR9","unstructured":"Kowalski, R., \u201cPredicate logic as a programming language,\u201d inProc. IFIP-74, pp. 569\u2013574, 1974."},{"key":"BF03037409_CR10","doi-asserted-by":"crossref","unstructured":"Leavenworth, B. M.,Nonprocedural Programming (Lecture Notes in Computer Science, 23), Springer, pp. 362\u2013385, 1975.","DOI":"10.1007\/3-540-07131-8_34"},{"issue":"No. 4","key":"BF03037409_CR11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF03037329","volume":"2","author":"T. Miyachi","year":"1984","unstructured":"Miyachi, T., Kunifuji, S., Kitakami, H., Furukawa, K., Takeuchi, A. and Yokota, H., \u201cA knowledge assimilation method for logic databases,\u201dNew Generation Computing, Vol. 2, No. 4, pp. 385\u2013404, 1984.","journal-title":"New Generation Computing"},{"issue":"No. 2","key":"BF03037409_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S. A. T\u00e4rnlund","year":"1977","unstructured":"T\u00e4rnlund, S. A., \u201cHorn clause computability,\u201dBIT, Vol. 17, No. 2, pp. 215\u2013226, 1977.","journal-title":"BIT"},{"key":"BF03037409_CR13","unstructured":"Yokomori, T., \u201cA logic program schema and its applications,\u201d inProc. of IJCAI-85, UCLA, CA, pp. 723\u2013735, August, 1985."},{"key":"BF03037409_CR14","unstructured":"Yokomori, T., \u201cOn Analogical Query Processing in Logic Database,\u201d inProc. of 12th Int. Conf. on VLDB, Kyoto, pp. 376\u2013383, 1986."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037409\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:52:36Z","timestamp":1558558356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF03037409"],"URL":"https:\/\/doi.org\/10.1007\/bf03037409","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}