{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T20:26:00Z","timestamp":1764793560936},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024183","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T04:49:34Z","timestamp":1132375774000},"page":"159-173","source":"Crossref","is-referenced-by-count":21,"title":["Elementary logic programs"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Boyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"G. Levi, \"Models, Unfolding Rules and Fixpoint Semantics\", in R. Kowalski, K. A. Bowen (eds.), Logic Programming: Proceedings of the Fifth International Conference and Symposium, p.1649\u20131665, MIT Pres, 1988."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, \"Foundations of Logic Programming\",(2nd ed.), Springer-Verlag,1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"M.J. Maher \"Equivalences of Logic Programs\",in J. Minker (ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, p. 627\u2013658, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50020-8"},{"key":"12_CR4","unstructured":"R.A. O'Keefe, electronic message on USENET in comp.lang.prolog, the 19-07-1988."},{"key":"12_CR5","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"G.D. Plotkin, \"A Note on Inductive Generalization\", in B. Meltzer, D. Mitchie (eds.), Machine Intelligence 5, p. 153\u2013165, 1970.","journal-title":"Machine Intelligence"},{"key":"12_CR6","first-page":"135","volume":"5","author":"J.C. Reynolds","year":"1970","unstructured":"J.C. Reynolds, \"Transformational Systems and the Algebraic Structure of Atomic Formulas\", in B. Meltzer, D. Mitchie (eds.), Machine Intelligence 5, p. 135\u2013151, 1970.","journal-title":"Machine Intelligence"},{"issue":"1","key":"12_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"J.A. Robinson, \"A Machine-oriented Logic Based on the Resolution Principle\", J. ACM 12,1, p. 23\u201341, 1965.","journal-title":"J. ACM"},{"key":"12_CR8","unstructured":"T. Sato, H. Tamaki, \"Unfold\/Fold Transformation of Logic Programs\" in Proc. of 2nd International Logic Programming Conference, p. 127\u2013138, 1984."},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF03037449","volume":"6","author":"T. Sato","year":"1989","unstructured":"T. Sato, H. Tamaki, \"Existential Continuation\", New Generation Computing 6, p. 421\u2013438, 1989.","journal-title":"New Generation Computing"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF03037456","volume":"5","author":"K. Ueda","year":"1987","unstructured":"K. Ueda, \"Making Exhaustive Search Programs Deterministic', New Generation Computing 5, p. 317\u2013326, 1987.","journal-title":"New Generation Computing"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"M.H. van Emden, R.A. Kowalski, \"The semantics of predicate logics as a programming language\", Journal of the A.C.M., 23(4), 733\u2013742.","DOI":"10.1145\/321978.321991"},{"key":"12_CR12","unstructured":"D.H.D. Warren, \"Higher order extensions to PROLOG: are they needed\", in Machine Intelligence 10, Ellis Horwood, 1982."},{"key":"12_CR13","unstructured":"R. Yang, \"Solving Simple Substitution Ciphers in Andorra-I\", in G. Levi and M. Martelli (eds.), Logic Programming: Proceedings of the Sixth International Conference, p. 113\u2013130, M.I.T. Press, 1989."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0024183","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T22:19:04Z","timestamp":1572905944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0024183","relation":{},"subject":[]}}