{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:32Z","timestamp":1725663692126},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512851"},{"type":"electronic","value":"9783540461845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51285-3_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:52:24Z","timestamp":1330203144000},"page":"104-114","source":"Crossref","is-referenced-by-count":1,"title":["Dataflow programs for parallel computations of logic programs and their semantics"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-13345-3_32","volume":"172","author":"M. Nait","year":"1984","unstructured":"Nait. M. A. Abdallah, On the interpretation of infinite computations in logic programming, Lecture Notes in Computer Science 172 (1984) 358\u2013370.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.P. Apt","year":"1982","unstructured":"K.P. Apt and M.H. van Emden, Contributions to the theory of logic programming, J. ACM 29 (1982) 841\u2013864.","journal-title":"J. ACM"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/0205029","volume":"5","author":"E.A. Ashcroft","year":"1976","unstructured":"E.A. Ashcroft and W.W. Wadge, Lucid-A formal system for writing and proving programs, SIAM J. Computing 5 (1976) 336\u2013354.","journal-title":"SIAM J. Computing"},{"key":"8_CR4","unstructured":"M.Baudinet, Proving termination properties of PROLOG programs: A semantic approach, Research Report STAN-CS-88-1202, Computer Science Dept., Stanford University (1988)."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (1976) 733\u2013742.","journal-title":"J. ACM"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0743-1066(85)90014-7","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting, A deterministic Prolog fixpoint semantics, J. of Logic Programming 2 (1985) 111\u2013118.","journal-title":"J. of Logic Programming"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Programming 2 (1985) 295\u2013312.","journal-title":"J. Logic Programming"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BFb0028799","volume":"199","author":"G. Frauden","year":"1985","unstructured":"G. Frauden, Logic programming and substitutions, Lecture Notes in Computer Science 199 (1985) 146\u2013158.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR9","first-page":"471","volume":"74","author":"G. Kahn","year":"1974","unstructured":"G. Kahn, The semantics of a simple language for parallel programming, Proc. IFIP 74 (1974) 471\u2013475.","journal-title":"Proc. IFIP"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J.L. Lassez","year":"1984","unstructured":"J.L. Lassez and M.J. Maher, Closures and fairness in the semantics of programming logic, Theoretical Computer Science 29 (1984) 167\u2013184.","journal-title":"Theoretical Computer Science"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(85)90128-8","volume":"39","author":"J.L. Lassez","year":"1985","unstructured":"J.L. Lassez and M.J. Maher, Maximal fixpoints of logic programs, Theoretical Computer Science 39 (1985) 15\u201325.","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","first-page":"133","volume-title":"Foundations of Computer Science IV","author":"D. Park","year":"1983","unstructured":"D. Park, The \u2018fairness\u2019 problem and nondeterministic computing networks, in: de Bakker and van Leeuwen, eds., Foundations of Computer Science IV (Mathematisch Centrum, Amsterdam, 1983) 133\u2013161."},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BFb0022475","volume":"70","author":"W.W. Wadge","year":"1979","unstructured":"W.W. Wadge, An extensional treatment of dataflow deadlock, Lecture Notes in Computer Science 70 (1979) 285\u2013299.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(87)90039-9","volume":"51","author":"S. Yamasaki","year":"1987","unstructured":"S. Yamasaki et al., A fixpoint semantics of Horn sentences based on substitution sets, Theoretical Computer Science 51 (1987) 309\u2013324.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","PARLE '89 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51285-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:02:25Z","timestamp":1619571745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51285-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512851","9783540461845"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-51285-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}