{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:26:34Z","timestamp":1672691194947},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":7624,"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":[[1992,9]]},"DOI":"10.1016\/0304-3975(92)90013-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"205-234","source":"Crossref","is-referenced-by-count":8,"title":["Testing logic programs for local stratification"],"prefix":"10.1016","volume":"103","author":[{"given":"Luigi","family":"Palopoli","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90013-6_BIB1","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\/0304-3975(92)90013-6_BIB2","series-title":"Graph Theory: An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/0304-3975(92)90013-6_BIB3","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(92)90013-6_BIB4","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(92)90013-6_BIB5","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the semantics of deductive databases and logic programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0304-3975(92)90013-6_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(86)90015-0","article-title":"The generalized counting method for recursive logic queries","volume":"62","author":"Sacc\u00e0","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90013-6_BIB7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","article-title":"Efficient tests for top-down termination of logical rules","volume":"35","author":"Ullman","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90013-6_BIB8","first-page":"221","article-title":"Unfounded sets and well-founded sematics for logic programs","author":"Van Gelder","year":"1988","journal-title":"Proc. ACM Symp. on Princ. of Database Systems"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900136?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900136?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:20:18Z","timestamp":1555129218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592900136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["0304397592900136"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90013-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}