乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T15:51:30Z","timestamp":1712764290976},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0890-5401(91)90059-b","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"50-66","source":"Crossref","is-referenced-by-count":71,"title":["The expressive power of stratified logic programs"],"prefix":"10.1016","volume":"90","author":[{"given":"Phokion G.","family":"Kolaitis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90059-B_BIB1","series-title":"Proceedings, 6th ACM Symposium on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0890-5401(91)90059-B_BIB2","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0890-5401(91)90059-B_BIB3","series-title":"Proceedings, Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"136","article-title":"Maintenance of stratified databases viewed as a belief revision system","author":"Apt","year":"1987"},{"key":"10.1016\/0890-5401(91)90059-B_BIB4","doi-asserted-by":"crossref","first-page":"80","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\/0890-5401(91)90059-B_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90059-B_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause queries and generalizations","volume":"1","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0890-5401(91)90059-B_BIB7","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0890-5401(91)90059-B_BIB8","series-title":"Computation Theory and Logic","first-page":"101","article-title":"Skolem normal forms concerning the least fixpoint","volume":"Vol. 270","author":"Dahlhaus","year":"1987"},{"key":"10.1016\/0890-5401(91)90059-B_BIB9","series-title":"Computation and Proof Theory","first-page":"175","article-title":"Towards logic tailored for computational complexity","volume":"Vol. 1104","author":"Gurevich","year":"1984"},{"key":"10.1016\/0890-5401(91)90059-B_BIB10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","article-title":"Fixed points extensions of first-order logic","volume":"32","author":"Gurevich","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0890-5401(91)90059-B_BIB11","series-title":"Proceedings, 15th ACM Symposium on the Theory of Computing","first-page":"347","article-title":"Languages which capture complexity classes","author":"Immerman","year":"1983"},{"key":"10.1016\/0890-5401(91)90059-B_BIB12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90059-B_BIB20","unstructured":"Kanellakis, P. (1987), Personal communication."},{"key":"10.1016\/0890-5401(91)90059-B_BIB13","series-title":"Foundations of Deductive, Databases and Logic Programming","first-page":"177","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/0890-5401(91)90059-B_BIB14","series-title":"Third International Conference on Logic Programming","first-page":"554","article-title":"Design overview of the NAIL! system","volume":"Vol. 225","author":"Morris","year":"1986"},{"key":"10.1016\/0890-5401(91)90059-B_BIB15","author":"Morris","year":"1987"},{"key":"10.1016\/0890-5401(91)90059-B_BIB16","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0890-5401(91)90059-B_BIB17","series-title":"Foundations of Deductive, Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive databases and logic programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0890-5401(91)90059-B_BIB18","series-title":"Proceedings, Third IEEE Symposium on Logic Programming","first-page":"137","article-title":"Negation as failure using tight derivations for general logic programs","author":"Van Gelder","year":"1986"},{"key":"10.1016\/0890-5401(91)90059-B_BIB19","series-title":"Proceedings, 14th ACM Symposium on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190059B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190059B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:25:33Z","timestamp":1549027533000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190059B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["089054019190059B"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90059-b","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}