{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:19:13Z","timestamp":1768450753215,"version":"3.49.0"},"reference-count":31,"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,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"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,10]]},"DOI":"10.1016\/s0022-0000(05)80053-4","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"334-361","source":"Crossref","is-referenced-by-count":47,"title":["A three-valued semantics for deductive databases and logic programs"],"prefix":"10.1016","volume":"49","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[]},{"given":"Li Yan","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80053-4_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\/S0022-0000(05)80053-4_bib2","series-title":"Proceedings, 8th ACM PODS","first-page":"34","article-title":"Logic programming as constructivism: A formalization and its application to databases","author":"Bry","year":"1989"},{"key":"10.1016\/S0022-0000(05)80053-4_bib3","series-title":"Logic and Databases","first-page":"193","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0022-0000(05)80053-4_bib4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","article-title":"A truth maintenance system","volume":"12","author":"Doyle","year":"1979","journal-title":"Artif. Intell."},{"key":"10.1016\/S0022-0000(05)80053-4_bib5","series-title":"Proceedings North American Conference on Logic Programming","first-page":"604","article-title":"A fixpoint approach to declarative semantics of logic programs","author":"Dung","year":"1989"},{"key":"10.1016\/S0022-0000(05)80053-4_bib6","series-title":"Proceedings, 8th International Conference on Logic Programming","first-page":"3","article-title":"Negations as hypotheses: An abductive foundation for logic programming","author":"Dung","year":"1991"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80053-4_bib7","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"2","author":"Van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80053-4_bib8","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":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0022-0000(05)80053-4_bib9","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"149","article-title":"Negation as failure using tight derivations for general logic programs","author":"Van Gelder","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib10","series-title":"Proceedings, 7th ACM PODS","first-page":"221","article-title":"Unfounded sets and well-founded semantics for general logic programs","author":"Van Gelder","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib11","series-title":"Proceedings, 8th ACM PODS","first-page":"1","article-title":"The alternating fixpoint of logic programs with negation","author":"Van Gelder","year":"1989"},{"key":"10.1016\/S0022-0000(05)80053-4_bib12","series-title":"Proceedings, 5th Symposium\/Conference on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","article-title":"Nonmonotonic logic and temporal projection","volume":"33","author":"Hanks","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/S0022-0000(05)80053-4_bib14","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1971"},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80053-4_bib15","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\/S0022-0000(05)80053-4_bib16","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"177","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0004-3702(88)90022-7","article-title":"The anomalous extension problem in default-reasoning","author":"Morris","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/S0022-0000(05)80053-4_bib18","series-title":"Proceedings, 5th Symposium\/Conference on Logic Programming","first-page":"1106","article-title":"Weakly perfect model semantics for logic programs","author":"Przymusinska","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib19","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\/S0022-0000(05)80053-4_bib20","series-title":"Proceedings, 5th Symposium\/Conference on Logic Programming","first-page":"1080","article-title":"Perfect model semantics","author":"Przymusinski","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(89)90067-2","article-title":"An algorithm to compute circumscription","volume":"38","author":"Przymusinski","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/S0022-0000(05)80053-4_bib22","series-title":"Proceedings, First Int'l Conference on Principle of Knowledge, Representation, and Reasoning","first-page":"341","article-title":"Three-valued formalizations of non-monotonic reasoning and logic programming","author":"Przymusinski","year":"1989"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80053-4_bib23","doi-asserted-by":"crossref","DOI":"10.1007\/BF00243002","article-title":"On the declarative and procedural semantics of logic programs","volume":"5","author":"Przymusinski","year":"1989","journal-title":"J. Automat. Reasoning"},{"key":"10.1016\/S0022-0000(05)80053-4_bib24","series-title":"Proceedings, the 8th ACM PODS","first-page":"11","article-title":"Every logic program has a natural stratification and an iterated least fixed point model","author":"Przymusinski","year":"1989"},{"key":"10.1016\/S0022-0000(05)80053-4_bib25","series-title":"Proceedings, 8th ACM PODS","first-page":"22","article-title":"A Procedural semantics for well founded negation in logic programs","author":"Ross","year":"1989"},{"key":"10.1016\/S0022-0000(05)80053-4_bib26","series-title":"Proceedings, 9th ACM PODS","first-page":"161","article-title":"Modular stratificatin and magic sets for DATALOG programs with negation","author":"Ross","year":"1990"},{"key":"10.1016\/S0022-0000(05)80053-4_bib27","series-title":"Proceedings, 9th ACM PODS","first-page":"196","article-title":"The expressive powers of the logic programming semantics","author":"Schlipf","year":"1990"},{"key":"10.1016\/S0022-0000(05)80053-4_bib28","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in logic programs","author":"Shepherson","year":"1988"},{"key":"10.1016\/S0022-0000(05)80053-4_bib29","series-title":"Proceedings, North American Conference on Logic Programming","first-page":"291","article-title":"Supported circumscription and its relation to logic programming with negation","author":"You","year":"1989"},{"key":"10.1016\/S0022-0000(05)80053-4_bib30","series-title":"Proceedings, 9th ACM PODS","first-page":"172","article-title":"Three-valued formalization of logic programming: Is it needed?","author":"You","year":"1990"},{"key":"10.1016\/S0022-0000(05)80053-4_bib31","series-title":"Proceedings, 10th Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"21","article-title":"Discriminant circumscription","volume":"Vol. 472","author":"Yuan","year":"1991"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800534?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800534?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:15Z","timestamp":1548196035000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800534"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80053-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}