{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T05:49:56Z","timestamp":1713937796927},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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":6499,"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":[[1995,10]]},"DOI":"10.1016\/0304-3975(95)00012-l","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"201-229","source":"Crossref","is-referenced-by-count":11,"title":["Fully abstract compositional semantics for an algebra of logic programs"],"prefix":"10.1016","volume":"149","author":[{"given":"Antonio","family":"Brogi","sequence":"first","affiliation":[]},{"given":"Franco","family":"Turini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00012-L_BIB1","first-page":"493","article-title":"Logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(95)00012-L_BIB2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1993.1051","article-title":"Reasoning about termination of pure Prolog programs","volume":"106","author":"Apt","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00012-L_BIB3","article-title":"Program construction in computational logic","author":"Brogi","year":"1993"},{"issue":"1","key":"10.1016\/0304-3975(95)00012-L_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF03037525","article-title":"Compositional model-theoretic semantics for logic programs","volume":"11","author":"Brogi","year":"1992","journal-title":"New Generation Computing"},{"key":"10.1016\/0304-3975(95)00012-L_BIB5","series-title":"Computational Logic, Symp. Proc.","first-page":"117","article-title":"Composition operators for logic theories","author":"Brogi","year":"1990"},{"key":"10.1016\/0304-3975(95)00012-L_BIB6","series-title":"Proc. 2nd Workshop on Meta-programming in Logic","first-page":"381","article-title":"Hierarchies through basic metalevel operators","author":"Brogi","year":"1990"},{"key":"10.1016\/0304-3975(95)00012-L_BIB7","series-title":"Constructing Logic Programs","first-page":"241","article-title":"Theory construction in computational logic","author":"Brogi","year":"1993"},{"issue":"4","key":"10.1016\/0304-3975(95)00012-L_BIB8","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1145\/183432.183528","article-title":"Modular logic programming","volume":"16","author":"Brogi","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0304-3975(95)00012-L_BIB9","series-title":"Principles of Knowledge Representation and Reasoning: Proc. 2nd Internat. Conf.","first-page":"100","article-title":"Metalogic for knowledge representation","author":"Brogi","year":"1990"},{"key":"10.1016\/0304-3975(95)00012-L_BIB10","series-title":"Proc. 20th Ann. ACM Symp. on Principles of Programming Languages","first-page":"451","article-title":"Compositional analysis of modular logic programs","author":"Codish","year":"1993"},{"issue":"3","key":"10.1016\/0304-3975(95)00012-L_BIB11","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(95)00012-L_BIB12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0743-1066(87)90019-7","article-title":"Enumeration operators and modular logic programming","volume":"4","author":"Fitting","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(95)00012-L_BIB13","series-title":"Proc. 16th ACM Symp. on Principles of Programming Languages","first-page":"134","article-title":"Fully abstract compositional semantics for logic programs","author":"Gaifman","year":"1989"},{"issue":"2","key":"10.1016\/0304-3975(95)00012-L_BIB14","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/3149.214118","article-title":"On the efficiency of subsumption algorithms","volume":"32","author":"Gottlob","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00012-L_BIB15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closures and fairness in the semantics of logic programming","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00012-L_BIB16","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(95)00012-L_BIB17","series-title":"Deductive Databases and Logic Programming","first-page":"627","article-title":"Equivalences of logic programs","author":"Maher","year":"1988"},{"key":"10.1016\/0304-3975(95)00012-L_BIB18","series-title":"Proc. 5th Internat. Conf. on Logic Programming","first-page":"1006","article-title":"An algebra of logic programs","author":"Mancarella","year":"1988"},{"key":"10.1016\/0304-3975(95)00012-L_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models for typed \u03bb-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00012-L_BIB20","series-title":"Proc. IEEE Symp. on Logic Programming","first-page":"152","article-title":"Towards an algebra for constructing logic programs","author":"O'Keefe","year":"1985"},{"key":"10.1016\/0304-3975(95)00012-L_BIB21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0304-3975(95)00012-L_BIB22","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500012L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500012L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:50:43Z","timestamp":1555419043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500012L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["030439759500012L"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00012-l","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}