{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T12:48:12Z","timestamp":1672231692859},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(00)00374-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:01:38Z","timestamp":1027612898000},"page":"663-676","source":"Crossref","is-referenced-by-count":4,"title":["Stratified negation in temporal logic programming and the cycle-sum test"],"prefix":"10.1016","volume":"254","author":[{"given":"P.","family":"Rondogiannis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"20","key":"10.1016\/S0304-3975(00)00374-1_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","article-title":"Logic programming and negation: a survey","volume":"19","author":"Apt","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(00)00374-1_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\/S0304-3975(00)00374-1_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB4","unstructured":"C. Coutras, C. Nomikos, On the computational complexity of stratified negation in linear-time temporal logic programming, Proc. 12th Internat. Symp. on Languages for Intensional Programming, Athens, Greece, June 1999, pp. 222\u2013231."},{"key":"10.1016\/S0304-3975(00)00374-1_BIB5","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB6","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB7","unstructured":"B. Lud\u00e4scher, Integration of active and deductive database rules, Ph.D. Thesis, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, 1998."},{"key":"10.1016\/S0304-3975(00)00374-1_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(95)00051-W","article-title":"An extensional treatment of lazy dataflow deadlock","volume":"151","author":"Matthews","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00374-1_BIB9","series-title":"Intensional Logics for Programming","first-page":"23","article-title":"Theory and practice of temporal logic programming","author":"Orgun","year":"1992"},{"issue":"4","key":"10.1016\/S0304-3975(00)00374-1_BIB10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0743-1066(92)90055-8","article-title":"Towards a unified theory of intensional logic programming","volume":"13","author":"Orgun","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB11","series-title":"Formal Techniques in Artificial Intelligence","first-page":"321","article-title":"Semantic issues in deductive databases and logic programs","author":"Przymusinska","year":"1990"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB12","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\/S0304-3975(00)00374-1_BIB13","unstructured":"P. Rondogiannis, Negation in Chronolog, Proc. 11th Internat. Symp. on Languages for Intensional Programming, Palo Alto, USA, May 7\u20139 1998, pp. 89\u201397."},{"key":"10.1016\/S0304-3975(00)00374-1_BIB14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0096-0551(98)00009-5","article-title":"Branching-time logic programming: the language Cactus and its applications","volume":"24","author":"Rondogiannis","year":"1998","journal-title":"Comput. Languages"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(81)90108-0","article-title":"An extensional treatment of dataflow deadlock","volume":"13","author":"Wadge","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00374-1_BIB16","series-title":"Lucid, the Dataflow Programming Language","author":"Wadge","year":"1985"},{"key":"10.1016\/S0304-3975(00)00374-1_BIB17","unstructured":"W.W. Wadge, Tense logic programming: a respectable alternative, Proc. 1988 Internat. Symp. on Lucid and Intensional Programming, 1988, pp. 26\u201332."},{"key":"10.1016\/S0304-3975(00)00374-1_BIB18","doi-asserted-by":"crossref","unstructured":"C. Zaniolo, N. Arni, K. Ong, Negation and aggregates in recursive rules: the LDL++ approach, Proc. DOOD-93, Phoenix, Arizona, USA, December 6\u20138 1993.","DOI":"10.1007\/3-540-57530-8_13"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:55:23Z","timestamp":1555880123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397500003741"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00374-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}