{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:16:49Z","timestamp":1648581409018},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6866,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0743-1066(94)90002-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"95-111","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence of well-founded and stable semantics"],"prefix":"10.1016","volume":"21","author":[{"given":"Fran\u00e7oise","family":"Gire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)90002-7_BIB1","first-page":"546","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1986","journal-title":"Workshop on Foundations of Deductive Databases and Logic Programming"},{"key":"10.1016\/0743-1066(94)90002-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(51)90004-7","article-title":"Negation by Default and Unstratifiable Logic Programs","author":"Bidoit","year":"1988"},{"key":"10.1016\/0743-1066(94)90002-7_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(51)90003-5","article-title":"Negation in Rule Based Database Languages: A Survey","volume":"78","author":"Bidoit","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(94)90002-7_BIB4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(92)90285-N","article-title":"On the Relations between Stable and Well-Founded Semantics of Logic Programs","volume":"105","author":"Dung","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(94)90002-7_BIB5","first-page":"601","article-title":"A Fixpoint Approach to Declarative Semantics of Logic Programs","author":"Dung","year":"1989"},{"key":"10.1016\/0743-1066(94)90002-7_BIB6","first-page":"51","volume":"vol. 1","author":"Fages","year":"1994","journal-title":"Methods Logic Comput. Sci."},{"key":"10.1016\/0743-1066(94)90002-7_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for Logic Programs","volume":"4","author":"Fitting","year":"1985","journal-title":"J. Logic Program."},{"key":"10.1016\/0743-1066(94)90002-7_BIB8","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programs","author":"Gelfond","year":"1988","journal-title":"Proceedings of the International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(94)90002-7_BIB9","first-page":"261","article-title":"Well Founded Semantics and Stable Semantics of Semi-Strict Programs","volume":"646","author":"Gire","year":"1992"},{"key":"10.1016\/0743-1066(94)90002-7_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed Data Dependencies in Logic Programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Program."},{"key":"10.1016\/0743-1066(94)90002-7_BIB11","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(94)90002-7_BIB12","first-page":"193","article-title":"On the Declarative Semantics of Deductive Databases and Logic Programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(94)90002-7_BIB13","first-page":"1081","article-title":"Perfect Model Semantics","author":"Przymusinski","year":"1988","journal-title":"Proceedings of the International Conference on Logic Programming"},{"issue":"1","key":"10.1016\/0743-1066(94)90002-7_BIB14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0743-1066(90)90032-Z","article-title":"Completed Logic Programs and their Consistency","volume":"9","author":"Sato","year":"1990","journal-title":"J. Logic Program."},{"key":"10.1016\/0743-1066(94)90002-7_BIB15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/308386.308444","article-title":"Unfounded Sets and Well Founded Semantics for General Logic Programs","author":"Van Gelder","year":"1988","journal-title":"Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD-SIGART"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:58:12Z","timestamp":1555113492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694900027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0743106694900027"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)90002-7","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}