{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T22:27:40Z","timestamp":1672698460648},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5745,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0004-3702(97)00058-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"467-479","source":"Crossref","is-referenced-by-count":10,"title":["A note on the stable model semantics for logic programs"],"prefix":"10.1016","volume":"96","author":[{"given":"Michael","family":"Kaminski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00058-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\u201320","author":"Apt","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(91)90073-B","article-title":"General logical databases and programs: default logic semantics and stratification","volume":"91","author":"Bidoit","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0004-3702(97)00058-1_BIB3","author":"Chang","year":"1990"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB4","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB5","series-title":"Proceedings AAAI-87","first-page":"207","article-title":"On stratified autoepstemic theories","author":"Gelfond","year":"1987"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB6","series-title":"Logic Programming: Proceedings 5th International Conference","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/S0004-3702(97)00058-1_BIB8","series-title":"Proceedings 2nd Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"397","article-title":"Reasoning in open domains","author":"Gelfond","year":"1993"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB9","series-title":"Proceedings 3rd International Workshop on Nonmonotonic Reasoning","article-title":"An alternative semantics for default logic","author":"Guerreiro","year":"1990"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0004-3702(94)00035-Y","article-title":"A comparative study of open default theories","volume":"77","author":"Kaminski","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB11","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/8.2.169","article-title":"Extensions for open default theories via the domain closure assumption","volume":"8","author":"Kaminski","year":"1998","journal-title":"J. Logic and Comput."},{"key":"10.1016\/S0004-3702(97)00058-1_BIB12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB13","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 Programming"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB14","series-title":"Computational Logic: Symposium Proceedings","first-page":"80","article-title":"On open defaults","author":"Lifschitz","year":"1990"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB15","series-title":"Proceedings IJCAI-91","first-page":"381","article-title":"Nonmonotonic databases and epistemic queries","author":"Lifschitz","year":"1991"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB16","author":"Lloyd","year":"1993"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB17","series-title":"Proceedings North American Conference on Logic Programming","first-page":"243","article-title":"Stable semantics for logic programs and default theories","author":"Marek","year":"1989"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014a form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","article-title":"A logical framework for default reasoning","volume":"36","author":"Poole","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00243002","article-title":"On the declarative and procedural semantics of logic programs","volume":"5","author":"Przymusinski","year":"1989","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB21","series-title":"Logic and Databases","first-page":"55","article-title":"On closed world databases","author":"Reiter","year":"1978"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB23","series-title":"Proceedings 8th Ann. ACM Symposium on Principles of Database Systems","first-page":"22","article-title":"A procedural semantics for well founded negation in logic programs","author":"Ross","year":"1989"},{"key":"10.1016\/S0004-3702(97)00058-1_BIB24","series-title":"Proceedings 7th Ann. ACM Symposium on Principles of Database Systems","first-page":"221","article-title":"Unfounded sets and well-founded semantics for general logic programs","author":"van Gelder","year":"1988"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:28:50Z","timestamp":1555050530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0004370297000581"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00058-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}