{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:31:26Z","timestamp":1648920686203},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0304-3975(94)90054-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"71-91","source":"Crossref","is-referenced-by-count":0,"title":["A denotational semantics and dataflow construction for logic programs"],"prefix":"10.1016","volume":"124","author":[{"given":"Susumu","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90054-X_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90054-X_BIB2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/0205029","article-title":"Lucid\u2014a formal system for writing and proving programs","volume":"5","author":"Ashcroft","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90054-X_BIB3","first-page":"336","article-title":"Proving termination properties of PROLOG programs: a semantic approach","author":"Baudinet","year":"1988","journal-title":"Proc. of 3rd Ann. Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)90054-X_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(90)90197-P","article-title":"Simple operational and denotational semantics for Prolog with cut","volume":"71","author":"Billaud","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90054-X_BIB5","first-page":"71","article-title":"Axiomatizations of backtracking","volume":"Vol. 577","author":"Billaud","year":"1992"},{"key":"10.1016\/0304-3975(94)90054-X_BIB6","first-page":"245","article-title":"Denotational and operational semantics for Prolog","volume":"Vol. III","author":"Debray","year":"1987"},{"key":"10.1016\/0304-3975(94)90054-X_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","article-title":"Properties of substitutions and unifiers","volume":"1","author":"Eder","year":"1985","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)90054-X_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behavior of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90054-X_BIB9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0743-1066(85)90014-7","article-title":"A deterministic Prolog fixpoint semantics","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90054-X_BIB10","first-page":"281","article-title":"Stepwise development of operational and denotational semantics for Prolog","author":"Jones","year":"1984","journal-title":"Proc. 1984 Internat. Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(94)90054-X_BIB11","first-page":"471","article-title":"The semantics of a simple language for parallel programming","author":"Kahn","year":"1974","journal-title":"Proc. IFIP 74"},{"key":"10.1016\/0304-3975(94)90054-X_BIB12","first-page":"386","article-title":"Algebraic properties of idempotent substitutions","volume":"Vol. 443","author":"Palamidessi","year":"1990"},{"key":"10.1016\/0304-3975(94)90054-X_BIB13","first-page":"133","article-title":"The \u201cfairness\u201d problem and nondeterministic computing networks","volume":"Vol. IV","author":"Park","year":"1983"},{"key":"10.1016\/0304-3975(94)90054-X_BIB14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(90)90023-B","article-title":"Recursion equation sets computing logic programs","volume":"76","author":"Yamasaki","year":"1990","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490054X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490054X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:26:18Z","timestamp":1555115178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759490054X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["030439759490054X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90054-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}