{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:25Z","timestamp":1725663685435},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544449"},{"type":"electronic","value":"9783540383628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_85","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:49:56Z","timestamp":1330210196000},"page":"27-38","source":"Crossref","is-referenced-by-count":0,"title":["Extraction of functional from logic program"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"Apt, K.R. and van Emden, M.H. (1982), Contributions to the theory of logic programming, J.ACM 29, 841\u2013864.","journal-title":"J.ACM"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/0205029","volume":"5","author":"E.A. Ashcroft","year":"1976","unstructured":"Ashcroft, E.A. and Wadge, W.W. (1976), Lucid-A formal system for writing and proving programs, SIAM J. Comput. 5, 336\u2013354.","journal-title":"SIAM J. Comput."},{"key":"3_CR3","unstructured":"Baudinet, M. (1988), Proving termination properties of PROLOG programs: A semantic approach, Res. Report STAN-CS-88-1202, Computer Science Dept., Stanford University."},{"issue":"3","key":"3_CR4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/65979.65984","volume":"11","author":"S.K. Debray","year":"1989","unstructured":"Debray, S.K. and Warren, D.S. (1989), Functional computations in logic programs, ACM Trans. on Programming Languages and Systems 11, 3, 451\u2013181.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E. Eder","year":"1985","unstructured":"Eder, E. (1985), Properties of substitutions and unifiers, J. Symbolic Computation 1, 31\u201346.","journal-title":"J. Symbolic Computation"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0743-1066(85)90014-7","volume":"2","author":"M. Fitting","year":"1985","unstructured":"Fitting, M. (1985a), A deterministic Prolog fixpoint semantics, J. Logic Programming 2, 111\u2013118.","journal-title":"J. Logic Programming"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"Fitting, M. (1985b), A Kripke-Kleene semantics for logic programs, J. Logic Programming 2, 295\u2013312.","journal-title":"J. Logic Programming"},{"key":"3_CR8","first-page":"471","volume":"74","author":"G. Kahn","year":"1974","unstructured":"Kahn, G. (1974), The semantics of a simple language for parallel programming, Proc. IFIP 74, 471\u2013475.","journal-title":"Proc. IFIP"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/BFb0032046","volume":"443","author":"C. Palamidessi","year":"1990","unstructured":"Palamidessi, C. (1990), Algebraic properties of idempotent substitutions, Lecture Notes in Computer Science 443, 386\u2013399.","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR10","first-page":"133","volume-title":"Foundations of Computer Science IV","author":"D. Park","year":"1983","unstructured":"Park, D. (1983), The \u201cfairness\u201d problem and nondeterministic computing networks, in \u201cFoundations of Computer Science IV\u201d (de Bakker and van Leeuwen, eds.), mathematisch Centrum, Amsterdam, 133\u2013161."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(90)90023-B","volume":"76","author":"S. Yamasaki","year":"1990","unstructured":"Yamasaki, S. (1990), Recursion equation sets computing logic programs, Theoretical Computer Science 76, 309\u2013322.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54444-5_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:02Z","timestamp":1619572922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}