{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:55Z","timestamp":1759638715751},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80071-6","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"562-588","source":"Crossref","is-referenced-by-count":36,"title":["Datalog vs first-order logic"],"prefix":"10.1016","volume":"49","author":[{"given":"Miklos","family":"Ajtai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Gurevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80071-6_bib1","series-title":"30th Annual Symposium on Foundations of Computer Science","first-page":"142","article-title":"Datalog vs. first-order logic","author":"Ajtai","year":"1989"},{"key":"10.1016\/S0022-0000(05)80071-6_bib2","series-title":"Principles of Database Systems","first-page":"311","article-title":"On the first-order expressibility of recursive queries","author":"Cosmadakis","year":"1987"},{"key":"10.1016\/S0022-0000(05)80071-6_bib3","unstructured":"B. Courcelle, Private communication."},{"key":"10.1016\/S0022-0000(05)80071-6_bib4","series-title":"Proceedings of the Herbrand Symposium, Logic Colloquium '81","article-title":"On local and non-local properties","author":"Gaifman","year":"1982"},{"key":"10.1016\/S0022-0000(05)80071-6_bib5","doi-asserted-by":"crossref","unstructured":"Y. Gurevich, Toward logic tailored for computational complexity, in \u201cComputation and Proof Theory\u201d (M. Richter et al., Ed.), Lecture Notes in Mathematics, Vol. 1104, pp. 175\u2013216.","DOI":"10.1007\/BFb0099486"},{"key":"10.1016\/S0022-0000(05)80071-6_bib6","unstructured":"P. Kolaitis and M. Y. Vardi, Private communication."},{"key":"10.1016\/S0022-0000(05)80071-6_bib7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors. III. Planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800716?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800716?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:04Z","timestamp":1548196024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800716"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80071-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}