{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T21:09:18Z","timestamp":1672693758878},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":8598,"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":[[1990]]},"DOI":"10.1016\/0304-3975(90)90062-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"67-83","source":"Crossref","is-referenced-by-count":3,"title":["A declarative semantics of flat guarded horn clauses for programs with perpetual processes"],"prefix":"10.1016","volume":"75","author":[{"given":"Masaki","family":"Murakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90062-M_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90062-M_BIB2","first-page":"347","article-title":"Uniform abstraction, atomicity and contractions in the comparative semantics of concurrent Prolog","author":"de Bakker","year":"1988","journal-title":"Proc. Internat. Conf. of Fifth Generation Computer Systems"},{"key":"10.1016\/0304-3975(90)90062-M_BIB3","article-title":"PARLOG: parallel programming in logic","volume":"86","author":"Clark","year":"1986","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0304-3975(90)90062-M_BIB4","series-title":"Tech. Report","article-title":"A more general declarative semantics for logic programming languages","author":"Falaschi","year":"1988"},{"key":"10.1016\/0304-3975(90)90062-M_BIB5","series-title":"Techn. Report","article-title":"Operational and fixpoint semantics of a class of commited-choice logic languages","author":"Falaschi","year":"1988"},{"key":"10.1016\/0304-3975(90)90062-M_BIB6","article-title":"Existential constraints, reactive behaviors and fully abstract compositional semantics concurrent logic programs","author":"Gairman","year":"1989","journal-title":"Proc. North American Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(90)90062-M_BIB7","article-title":"An approach to the declarative semantics of synchronization in logic languages","volume":"87","author":"Levi","year":"1987","journal-title":"Proc. Internat. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(90)90062-M_BIB8","article-title":"A new declarative semantics of Flat Guarded Horn Clauses","author":"Levi","year":"1988","journal-title":"ICOT Technical Report, TR-345"},{"key":"10.1016\/0304-3975(90)90062-M_BIB9","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0304-3975(90)90062-M_BIB10","article-title":"Logic semantics for a class of committed-choice programs","volume":"87","author":"Maher","year":"1987","journal-title":"Proc. Internat. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(90)90062-M_BIB11","article-title":"A declarative semantics of parallel logic programs with perpetual processes","author":"Murakami","year":"1988","journal-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems"},{"key":"10.1016\/0304-3975(90)90062-M_BIB12","article-title":"A declarative semantics of parallel logic programs based on failure\/deadlock set","author":"Murakami","year":"1988","journal-title":"ICOT Technical Memo, TM-602"},{"key":"10.1016\/0304-3975(90)90062-M_BIB13","article-title":"Fixpoint induction and proofs of program properties","volume":"5","author":"Park","year":"1969"},{"key":"10.1016\/0304-3975(90)90062-M_BIB14","article-title":"A fixpoint characterization of stream parallelism in logic programs","author":"Sakakibara","year":"1985","journal-title":"Proc. 2nd Conf. JSSST"},{"key":"10.1016\/0304-3975(90)90062-M_BIB15","article-title":"Partial Correctness Semantics for CP[\u2193,|,&]","volume":"206","author":"Saraswat","year":"1985"},{"key":"10.1016\/0304-3975(90)90062-M_BIB16","article-title":"The Concurrent logic programming CP: definition and operational semantics","author":"Saraswat","year":"1987","journal-title":"Proc. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90062-M_BIB17","first-page":"347","article-title":"GHC: operational semantics, problems and relationship with CP(\u2193,|)","author":"Saraswat","year":"1987","journal-title":"IEEE Internat. Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(90)90062-M_BIB18","series-title":"Ph.D. thesis of Computer Science Department","article-title":"Concurrent constraint programming languages","author":"Saraswat","year":"1989"},{"key":"10.1016\/0304-3975(90)90062-M_BIB19","article-title":"Concurrent Prolog: A Progress Report","volume":"232","author":"Shapiro","year":"1986"},{"key":"10.1016\/0304-3975(90)90062-M_BIB20","article-title":"A compositional semantics of GHC","author":"Shibayama","year":"1987","journal-title":"Proc. 4th Conf. JSSST"},{"key":"10.1016\/0304-3975(90)90062-M_BIB21","article-title":"Towards a semantic model of GHC","author":"Takeuchi","year":"1986","journal-title":"Tech. Rep. of IECE, COMP86-59"},{"key":"10.1016\/0304-3975(90)90062-M_BIB22","first-page":"582","article-title":"Transformation rules for GHC programs","author":"Ueda","year":"1988","journal-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems"},{"key":"10.1016\/0304-3975(90)90062-M_BIB23","unstructured":"K. Ueda, Guarded Horn Clauses (MIT Press, Cambridge, MA) to appear."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090062M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090062M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:07Z","timestamp":1555127527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090062M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990]]}},"alternative-id":["030439759090062M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90062-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990]]}}}