{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:10Z","timestamp":1725663850399},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539193"},{"type":"electronic","value":"9783540463986"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53919-0_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:17:50Z","timestamp":1330208270000},"page":"73-86","source":"Crossref","is-referenced-by-count":3,"title":["Elementary formal system as a logic programming language"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.2206\/kyushumfs.24.47","volume":"24","author":"S. Arikawa","year":"1970","unstructured":"Arikawa, S., Elementary Formal Systems and Formal Languages \u2014 Simple Formal Systems. Memoirs of Fac. Sci., Kyushu University Ser. A. Math. 24:47\u201375 (1970).","journal-title":"Memoirs of Fac. Sci., Kyushu University Ser. A. Math."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Arikawa, S., Shinohara, T., and Yamamoto, A., Elementary Formal System as a Unifying Framework for Language Learning, in Rivest, R., Haussler, D., and Warmuth, M. K. (eds.), Proc. COLT'89, 312\u2013327, Morgan-Kaufmann, 1989.","DOI":"10.1016\/B978-0-08-094829-4.50025-8"},{"key":"5_CR3","unstructured":"Arimura, H., Completeness of Depth-Bounded Resolution in Logic Programming, Internal report, Research Institute of Fundamental Information Science, Kyushu University, 1989, to appear in 6th Conf. Proc. of JSSST."},{"issue":"22","key":"5_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"8","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N. and Manna, Z., Proving Termination with Multiset Orderings. CACM 8(22):465\u2013476 (1979).","journal-title":"CACM"},{"key":"5_CR5","unstructured":"Fitting, M., Computability Theory, Semantics, and Logic Programming, Oxford University Press, 1987."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and Lassez, J.-L., Constraint Logic Programming, in Proc. Conference on Principle of Programming Languages, 1987.","DOI":"10.1145\/41625.41635"},{"key":"5_CR7","unstructured":"Jaffar, J., Lassez, J.-L., and Maher, M. J., Logic Programming Scheme, in DeGroot, D. and Lindstrom, G. (eds.), Logic Programming: Functions, Relations, and Equations, 211\u2013233, Prentice-Hall, 1986."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W., Foundations of Logic Programming Second, Extended Edition, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"2","key":"5_CR9","first-page":"330","volume":"18","author":"G. S. Makanin","year":"1977","unstructured":"Makanin, G. S., The Problem of Solvability of Equations in a Free Semigroup. Soviet Math. Dokl. 18(2):330\u2013335 (1977).","journal-title":"Soviet Math. Dokl."},{"key":"5_CR10","unstructured":"Plotkin, G. D., Building in Equational Theories, in Machine Intelligence 7, 132\u2013147, Edinburgh University Press, 1972."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Reiter, R., On Closed World Data Bases, in Gallaire, H. and Minker, J. (eds.), Logic and Data Bases, 55\u201376, Plenum Press, 1978.","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"5_CR12","unstructured":"Shapiro, E. Y.. Inductive Inference of Theories From Facts. Research Report 192, Yale University, 1981."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Smullyan, R. M., Theory of Formal Systems, Princeton Univ. Press, 1961.","DOI":"10.1515\/9781400882007"},{"key":"5_CR14","unstructured":"Yamamoto, A., A Theoretical Combination of SLD-Resolution and Narrowing, in Lassez, J.-L. (ed.), Proc. 4th ICLP, 470\u2013487, The MIT Press, 1987."}],"container-title":["Lecture Notes in Computer Science","Logic Programming '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53919-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:27Z","timestamp":1605646287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53919-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539193","9783540463986"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-53919-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}