{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:07Z","timestamp":1759638187702,"version":"3.30.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"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,5]]},"DOI":"10.1016\/s0304-3975(00)00045-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:56Z","timestamp":1027634576000},"page":"523-553","source":"Crossref","is-referenced-by-count":9,"title":["On the equivalence of the static and disjunctive well-founded semantics and its computation"],"prefix":"10.1016","volume":"258","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teodor","family":"C. Przymusinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3\/4","key":"10.1016\/S0304-3975(00)00045-1_BIB1","first-page":"151","article-title":"DisLoP","volume":"10","author":"Aravindan","year":"1997","journal-title":"AI Comm."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB2","first-page":"1","article-title":"Hyper tableaux","volume":"vol. 1126","author":"Baumgartner","year":"1996"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB3","series-title":"Innovationen bei Rechen- und Kommunikationssystemen, IFIP \u201994-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases","first-page":"83","article-title":"A disjunctive semantics based on unfolding and bottom-up evaluation","author":"Brass","year":"1994"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB4","first-page":"127","article-title":"A general approach to bottom-up computation of disjunctive semantics","volume":"vol. 927","author":"Brass","year":"1995"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB5","doi-asserted-by":"crossref","unstructured":"S. Brass, J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, J. Logic Programm. 32(3) (1997) 207\u2013228. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proc. 3rd Internat. Conf., Kentucky, Lecture Notes in Computer Science, vol. 928, Springer, Berlin, 1995, pp. 85\u201398.)","DOI":"10.1016\/S0743-1066(96)00115-X"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB6","unstructured":"S. Brass, J. Dix, Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, J. Automat. Reason. 20(1) (1998) 143\u2013165. (Extended abstract appeared in: Characterizing D-WFS: confluence and iterated GCWA, Logics in Artificial Intelligence, JELIA \u201996, Lecture Notes in Computer Science, vol. 1126, Springer, Berlin, 1996, pp. 268\u2013283.)"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB7","doi-asserted-by":"crossref","unstructured":"S. Brass, J. Dix, Semantics of (disjunctive) logic programs based on partial evaluation, J. Logic Programm. 38(3) (1999) 167\u2013213. (Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. 12th Internat. Logic Programming Conf., Tokyo, MIT Press, Cambridge, MA, 1995, pp. 199\u2013213.)","DOI":"10.7551\/mitpress\/4298.003.0027"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB8","doi-asserted-by":"crossref","unstructured":"S. Brass, J. Dix, T. Przymusinski, Computation of the semantics of autoepistemic belief theories, Artificial Intelligence, 112(1\u20132) (1999).","DOI":"10.1016\/S0004-3702(99)00043-0"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB9","first-page":"253","article-title":"Bottom-up query evaluation with partially ordered defaults","volume":"vol. 760","author":"Brass","year":"1993"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB10","unstructured":"G. Brewka, J. Dix, Knowledge representation with extended logic programs, in: D. Gabbay, F. Guenthner (Eds.), Hand of Philosophical Logic, 2nd ed., vol. 6, Methodologies, Reidel Publ., Dordrecht, 2000 (Chapter 6). Shortened version also appeared in: Dix, Pereira, Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, vol. 1471, Springer, Berlin, 1998, pp. 1\u201355."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB11","series-title":"Logic, Action and Information \u2013 Essays on Logic in Philosophy and Artificial Intelligence","first-page":"241","article-title":"Semantics of logic programs: their intuitions and formal properties. An overview","author":"Dix","year":"1995"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB12","unstructured":"J. Dix, U. Furbach, A. Nerode (Eds.), in: Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, vol. 1265, Springer, Berlin, 1997."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB13","doi-asserted-by":"crossref","unstructured":"T. Eiter, G. Gottlob, Complexity aspects of various semantics for disjunctive databases, Proc. 12th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS\u201993) (1993) 158\u2013167.","DOI":"10.1145\/153850.153864"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB14","doi-asserted-by":"crossref","unstructured":"T. Eiter, G. Gottlob, H. Mannila, Adding disjunction to datalog, Proc. 13th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS\u201994) (1994) 267\u2013278.","DOI":"10.1145\/182591.182639"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB15","unstructured":"T. Eiter, G. Gottlob, M\u00e4chtigkeit von Logikprogrammierung \u00fcber Datenbanken, KI 3 (1996) 32\u201339."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB16","doi-asserted-by":"crossref","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello, A deductive system for non-monotonic reasoning, in: J. Dix, U. Furbach, A. Nerode (Eds.), Logic Programming and Non-Monotonic Reasoning, Proc. 4th Internat. Conf., Lecture Notes in Artificial Intelligence, vol. 1265, Springer, Berlin, June 1997,, 363\u2013374.","DOI":"10.1007\/3-540-63255-7_27"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB17","series-title":"5th Conf. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB18","series-title":"Proc. of 7th Internat. Conf. on Logic Programming","first-page":"579","article-title":"Logic program with classical negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","article-title":"On the relationship between circumscription and negation as failure","volume":"38","author":"Gelfond","year":"1989","journal-title":"Artificial Intelligence"},{"issue":"5","key":"10.1016\/S0304-3975(00)00045-1_BIB20","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/int.4550050507","article-title":"On the relationship between CWA, minimal model and minimal Herbrand model Semantics","volume":"5","author":"Gelfond","year":"1990","journal-title":"Internat. J. Intelligent Systems"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB21","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/320083.320088","article-title":"On semantic issues connected with incomplete information databases","volume":"4","author":"Lipski","year":"1979","journal-title":"ACM Trans. Database Systems"},{"year":"1992","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","key":"10.1016\/S0304-3975(00)00045-1_BIB22"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription: a form of nonmonotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB24","doi-asserted-by":"crossref","unstructured":"J. Minker, On indefinite databases and the closed world assumption, Proc. 6th Conf. on Automated Deduction, New York, Springer, Berlin, 1982, pp. 292\u2013308.","DOI":"10.1007\/BFb0000066"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB25","first-page":"3","article-title":"Logic and databases","volume":"vol. 1154","author":"Minker","year":"1996"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB26","unstructured":"I. Niemel\u00e4, Implementing circumscription using a tableau method, in: W. Wahlster, Proc. European Conf. Artificial Intelligence, Budapest, Hungary, Wiley, New York, August 1996,, pp. 80\u201384."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB27","first-page":"278","article-title":"A tableau calculus for minimal model reasoning","volume":"vol. 1071","author":"Niemel\u00e4","year":"1996"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB28","first-page":"445","article-title":"Well-founded semantics coincides with three-valued stable semantics","volume":"XIII","author":"Przymusinski","year":"1990","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB29","unstructured":"T. Przymusinski, Well-founded completions of logic programs, Proc. 8th Internat. Logic Programming Conf., Paris, France, MIT Press, Cambridge, MA, July 1991, pp. 726\u2013744."},{"key":"10.1016\/S0304-3975(00)00045-1_BIB30","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01530826","article-title":"Static semantics for normal and disjunctive logic programs","volume":"14","author":"Przymusinski","year":"1995","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0004-3702(97)00032-5","article-title":"Autoepistemic logic of knowledge and beliefs","volume":"95","author":"Przymusinski","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB32","first-page":"170","volume":"vol. 883","author":"Sakama","year":"1994"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB33","doi-asserted-by":"crossref","unstructured":"D. Seipel, An efficient computation of the extended generalized closed world assumption by support-for-negation sets, Proc. Internat. Conf. on Logic Programming and Automated Reasoning (LPAR\u201994), Lecture Notes in Artifical Intelligence, vol. 822, Springer, Berlin, pp. 245\u2013259.","DOI":"10.1007\/3-540-58216-9_42"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB34","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00045-1_BIB35","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00881833","article-title":"Autoepistemic circumscription and logic programming","volume":"10","author":"You","year":"1993","journal-title":"J. Automat. Reason."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T16:22:59Z","timestamp":1733415779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500000451"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00045-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}