{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:09Z","timestamp":1759638729356,"version":"3.41.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1023\/a:1005952908693","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T00:10:48Z","timestamp":1040515848000},"page":"143-165","source":"Crossref","is-referenced-by-count":34,"title":["Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA"],"prefix":"10.1007","volume":"20","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"}]}],"member":"297","reference":[{"key":"146979_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\u201320","author":"K. R. Apt","year":"1994","unstructured":"Apt, K. R. and Bol, R. N.: Logic programming and negation: A Survey, J. Logic Programming\n19\u201320 (1994), 9\u201371.","journal-title":"J. Logic Programming"},{"key":"146979_CR2","doi-asserted-by":"crossref","unstructured":"Baral, Ch. and Gelfond, M.: Logic programming and knowledge representation, J. Logic Programming\n19\u201320 (1994).","DOI":"10.1016\/0743-1066(94)90025-6"},{"key":"146979_CR3","doi-asserted-by":"crossref","unstructured":"Baral, Ch., Lobo, J. and Minker, J.: Generalized disjunctive well-founded semantics for logic programs: Declarative semantics, in Z. W. Ras, M. Zemankova and M. L. Emrich (eds), Proc. 5th Int. Symp. on Methodologies for Intelligent Systems, Knoxville, TN, October 1990, North-Holland, 1990, pp. 465\u2013473.","DOI":"10.21236\/ADA232064"},{"key":"146979_CR4","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/3-540-54563-8_109","volume-title":"Methodologies for Intelligent Systems","author":"C. Baral","year":"1991","unstructured":"Baral, Ch., Lobo, J. and Minker, J.: WF3: A semantics for negation in normal disjunctive logic programs, in Z. W. Ras and M. Zemankova (eds), Methodologies for Intelligent Systems, LNAI 542, Springer, Berlin, 1991, pp. 459\u2013468."},{"key":"146979_CR5","doi-asserted-by":"crossref","unstructured":"Baumgartner, P., Furbach, U. and Niemel\u00e4, I.: Hyper tableaux, in L. M. Pereira, J. J. Alferes and E. Orlowska (eds), Logics in Artificial Intelligence (JELIA' 96), LNCS 1126, Springer, 1996, pp. 1\u201317.","DOI":"10.1007\/3-540-61630-6_1"},{"key":"146979_CR6","doi-asserted-by":"crossref","unstructured":"Bidoit, B. and Hull, R.: Positivism vs. minimalism in deductive databases, in Proc. 5th ACM Symp. on Principles of Database Systems (PODS'86), 1986, pp. 123\u2013132.","DOI":"10.1145\/6012.15409"},{"key":"146979_CR7","unstructured":"Brass, S. and Dix, J.: Computing disjunctive stable semantics based on Clark's completed database, in Proc. 6th GI-Workshop 'Grundlagen von Datenbanken', Bad Helmstedt, September 1994, 1994, pp. 30\u201334."},{"key":"146979_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-51136-3_13","volume-title":"Innovationen bei Rechen-und Kommunikationssystemen","author":"S. Brass","year":"1994","unstructured":"Brass, S. and Dix, J.: A disjunctive semantics based on unfolding and bottom-up evaluation, in Bernd Wolfinger (ed.), Innovationen bei Rechen-und Kommunikationssystemen (IFIP' 94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), Springer, Berlin, 1994, pp. 83\u201391."},{"key":"146979_CR9","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BFb0030663","volume-title":"Nonmonotonic Extensions of Logic Programming","author":"S. Brass","year":"1995","unstructured":"Brass, S. and Dix, J.: A general approach to bottom-up computation of disjunctive semantics, in J. Dix, L. Pereira, and T. Przymusinski (eds), Nonmonotonic Extensions of Logic Programming, LNAI 927, Springer, Berlin, 1995, pp. 127\u2013155."},{"issue":"3","key":"146979_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","volume":"32","author":"S. Brass","year":"1997","unstructured":"Brass, S. and Dix, J.: Characterizations of the disjunctive stable semantics by partial evaluation, J. Logic Programming\n32(3) (1997), 207\u2013228. (Extended abstract appeared in: Characterizations of the stable semantics by partial evaluation, LPNMR, Proc. 3rd Int. Conf., Kentucky, LNCS 928, Springer, 1995, pp. 85\u201398.)","journal-title":"J. Logic Programming"},{"key":"146979_CR11","doi-asserted-by":"crossref","unstructured":"Brass, S. and Dix, J.: Semantics of disjunctive logic programs based on partial evaluation, J. Logic Programming, accepted for publication, 1998. (Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. 12th Int. Logic Programming Conference, Tokyo, MIT Press, 1995, pp. 199\u2013213.)","DOI":"10.7551\/mitpress\/4298.003.0027"},{"key":"146979_CR12","unstructured":"Brass, S., Dix, J., Niemel\u00e4, I. and Przymusinski, T. C.: Comparison and efficient computation of the static and the disjunctive WFS, in G. Brewka, E. Weydert, and C. Witteveen (eds), Proc. 3rd Dutch\u2013German Workshop on Nonmonotonic Reasoning and Its Applications, 1997, pp. 37\u201342."},{"key":"146979_CR13","first-page":"529","volume-title":"Principles of Knowledge Representation and Reasoning: Proc. 5th Int. Conf. (KR' 96)","author":"S. Brass","year":"1996","unstructured":"Brass, S., Dix, J. and Przymusinski, T. C.: Super logic programs, in L. C. Aiello, J. Doyle, and S. C. Shapiro (eds), Principles of Knowledge Representation and Reasoning: Proc. 5th Int. Conf. (KR' 96), Morgan Kaufmann, San Francisco, CA, 1996, pp. 529\u2013541."},{"key":"146979_CR14","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BFb0023807","volume-title":"Nonmonotonic Extensions of Logic Programming","author":"S. Brass","year":"1997","unstructured":"Brass, S., Zukowski, U. and Freitag, B.: Transformation based bottom-up computation of the well-founded model, in J. Dix, L. Pereira, and T. Przymusinski (eds), Nonmonotonic Extensions of Logic Programming, LNAI 1216, Springer, Berlin, 1997, pp. 171\u2013201."},{"key":"146979_CR15","series-title":"CSLI Lecture Notes","volume-title":"Nonmonotonic Reasoning: An Overview","author":"G. Brewka","year":"1997","unstructured":"Brewka, G., Dix, J. and Konolige, K.: Nonmonotonic Reasoning: An Overview, CSLI Lecture Notes 73, CSLI Publications, Stanford, CA, 1997."},{"key":"146979_CR16","unstructured":"Brewka, G. and Dix, J.: Knowledge representation with logic programs, Technical report, Tutorial Notes of the 12th European Conference on Artificial Intelligence (ECAI' 96), 1996. Also appeared as Technical Report 15\/96, Dept. of CS of the University of Koblenz-Landau. Will appear as Chapter 6 in Handbook of Philosophical Logic, 2nd edition (1998), Volume 6, Methodologies."},{"key":"146979_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data-Bases","author":"K. L. Clark","year":"1978","unstructured":"Clark, K. L.: Negation as failure, in H. Gallaire and J. Minker (eds), Logic and Data-Bases, Plenum, New York, 1978, pp. 293\u2013322."},{"key":"146979_CR18","series-title":"LNAI","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030655","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"J. Dix","year":"1995","unstructured":"Dix, J., Pereira, L. and Przymusinski, T.: Non-Monotonic Extensions of Logic Programming, LNAI 927, Springer, Berlin, 1995."},{"key":"146979_CR19","series-title":"LNAI","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0023798","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"J. Dix","year":"1997","unstructured":"Dix, J., Pereira, L. and Przymusinski, T.: Non-Monotonic Extensions of Logic Programming, LNAI 1216, Springer, Berlin, 1997."},{"key":"146979_CR20","first-page":"591","volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR' 92)","author":"J. Dix","year":"1992","unstructured":"Dix, J.: A framework for representing and characterizing semantics of logic programs, in B. Nebel, C. Rich, and W. Swartout (eds), Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR' 92), Morgan Kaufmann, San Mateo, CA, 1992, pp. 591\u2013602."},{"issue":"3","key":"146979_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","volume":"22","author":"J. Dix","year":"1995","unstructured":"Dix, J.: A classification-theory of semantics of normal logic programs: I. Strong properties, Fundamenta Informaticae\n22(3) (1995), 227\u2013255.","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"146979_CR22","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"22","author":"J. Dix","year":"1995","unstructured":"Dix, J.: A classification-theory of semantics of normal logic programs: II. Weak properties, Fundamenta Informaticae\n22(3) (1995), 257\u2013288.","journal-title":"Fundamenta Informaticae"},{"key":"146979_CR23","unstructured":"Dix, J.: Semantics of logic programs, their intuitions and formal properties: An overview, in A. Fuhrmann and H. Rott (eds), Logic, Action and Information \u2013 Essays on Logic in Philosophy and Artificial Intelligence, DeGruyter, 1995, pp. 241\u2013327."},{"key":"146979_CR24","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BFb0023808","volume-title":"Nonmonotonic Extensions of Logic Programming","author":"J. Dix","year":"1997","unstructured":"Dix, J. and Stolzenburg, F.: Computation of nonground disjunctive well-founded semantics with constraint logic programming (preliminary report), in J. Dix, L. Pereira, and T. Przymusinski (eds), Nonmonotonic Extensions of Logic Programming, LNAI 1216, Springer, Berlin, 1997, pp. 202\u2013226."},{"key":"146979_CR25","doi-asserted-by":"crossref","unstructured":"Dix, J. and Stolzenburg, F.: A framework to incorporate nonmonotonic reasoning into constraint logic programming, J. Logic Programming (1998). Special Issue on Constraint Logic Programming, Guest Editors: Kim Marriott and Peter Stuckey, to appear.","DOI":"10.1016\/S0743-1066(98)10003-1"},{"issue":"2","key":"146979_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"144","author":"T. Eiter","year":"1993","unstructured":"Eiter, Th. and Gottlob, G.: Propositional circumscription and extended closed world reasoning are \u03a0P2-complete, Theoretical Computer Science\n144(2) (1993), 231\u2013245, Addendum: 118 (1993), 315.","journal-title":"Theoretical Computer Science"},{"key":"146979_CR27","unstructured":"Eiter, Th., Gottlob, G. and Mannila, H.: Expressive power and complexity of disjunctive DATALOG, in Proc. Workshop on Logic Programming with Incomplete Information, Vancouver Oct. 1993, following ILPS' 93, 1993, pp. 59\u201379."},{"key":"146979_CR28","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M. and Lifschitz, V.: Classical negation in logic programs and disjunctive databases, New Generation Computing\n9 (1991), 365\u2013387. (Extended abstract appeared in: Logic Programs with Classical Negation. Proc. 7th Int. Logic Programming Conference, Jerusalem, MIT Press, 1990, pp. 579\u2013597.)","journal-title":"New Generation Computing"},{"key":"146979_CR29","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J. and Rajasekar, A.: Foundations of Disjunctive Logic Programming, MIT-Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"146979_CR30","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume-title":"Proc. 6th Conference on Automated Deduction, New York","author":"J. Minker","year":"1982","unstructured":"Minker, J.: On indefinite databases and the closed world assumption, in Proc. 6th Conference on Automated Deduction, New York, Springer, Berlin, 1982, pp. 292\u2013308."},{"key":"146979_CR31","doi-asserted-by":"crossref","unstructured":"Minker, J.: An overview of nonmonotonic reasoning and logic programming, J. Logic Programming, Special Issue\n17 (1993).","DOI":"10.1016\/0743-1066(93)90028-F"},{"key":"146979_CR32","series-title":"LNCS","first-page":"3","volume-title":"Proc. Int. Workshop on Logic in Databases (LID)","author":"J. Minker","year":"1996","unstructured":"Minker, J.: Logic and databases: A 20 year retrospective, in D. Pedreschi and C. Zaniolo (eds), Proc. Int. Workshop on Logic in Databases (LID), LNCS 1154, Springer, Berlin, 1996, pp. 3\u201358."},{"key":"146979_CR33","first-page":"80","volume-title":"Proc. European Conference on Artificial Intelligence","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I.: Implementing circumscription using a tableau method, in W. Wahlster (ed.), Proc. European Conference on Artificial Intelligence, John Wiley, Budapest, Hungary, 1996, pp. 80\u201384."},{"key":"146979_CR34","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-61208-4_18","volume-title":"Proc. Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I.: A tableau calculus for minimal model reasoning, in P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi (eds), Proc. Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071, Springer-Verlag, Terrasini, Italy, 1996, pp. 278\u2013294."},{"key":"146979_CR35","first-page":"289","volume-title":"Proc. Joint International Conference and Symposium on Logic Programming","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I. and Simons, P.: Efficient implementation of the well-founded and stable model semantics, in M. Maher (ed.), Proc. Joint International Conference and Symposium on Logic Programming, The MIT Press, Bonn, Germany, 1996, pp. 289\u2013303."},{"key":"146979_CR36","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Pzymusinski","year":"1991","unstructured":"Pzymusinski, T.: Stable semantics for disjunctive programs, New Generation Computing Journal\n9 (1991), 401\u2013424. (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs. Proc. 7th Int. Logic Programming Conference, Jerusalem, MIT Press, Cambridge, Mass., 1990, pp. 459\u2013477.)","journal-title":"New Generation Computing Journal"},{"key":"146979_CR37","series-title":"LNCS","volume-title":"DOOD' 91, Proc. 2nd Int. Conf.","author":"T. Przymusinski","year":"1991","unstructured":"Przymusinski, T.: Stationary semantics for normal and disjunctive logic programs, in C. Delobel, M. Kifer, and Y. Masunaga (eds), DOOD' 91, Proc. 2nd Int. Conf., LNCS 566, Springer, Muenchen, Berlin, 1991."},{"key":"146979_CR38","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01530826","volume":"14","author":"T. Przymusinski","year":"1995","unstructured":"Przymusinski, T.: Static semantics for normal and disjunctive logic programs, Ann. Math. Artificial Intelligence\n14 (1995), 323\u2013357.","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"146979_CR39","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","volume":"5","author":"A. Rajasekar","year":"1989","unstructured":"Rajasekar, A., Lobo, J. and Minker, J.: Weak generalized closed world assumption, J. Automated Reasoning\n5 (1989), 293\u2013307.","journal-title":"J. Automated Reasoning"},{"key":"146979_CR40","doi-asserted-by":"crossref","unstructured":"Ross, K. A.: The well-founded semantics for disjunctive logic programs, in Proc.1st Int, Conf. on Deductive and Object Oriented Databases, Kyoto, Japan, 1989, pp. 1\u201322.","DOI":"10.1016\/B978-0-444-88433-6.50029-0"},{"key":"146979_CR41","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K. A. Ross","year":"1988","unstructured":"Ross, K. A. and Topor, R. A.: Inferring negative information from disjunctive databases, J. Automated Reasoning\n4 (1988), 397\u2013424.","journal-title":"J. Automated Reasoning"},{"key":"146979_CR42","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-58792-6_11","volume-title":"Logic Program Synthesis and Transformation \u2013 Meta Programming in Logic","author":"C. Sakama","year":"1994","unstructured":"Sakama, Ch. and Seki, H.: Partial deduction of disjunctive logic programs: A declarative approach, in Logic Program Synthesis and Transformation \u2013 Meta Programming in Logic, LNCS 883, Springer, Berlin, 1994, pp. 170\u2013182."},{"key":"146979_CR43","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01543479","volume":"5","author":"J. S. Schlipf","year":"1992","unstructured":"Schlipf, J. S.: Formalizing a logic for logic programming, Ann. Math. Artificial Intelligence\n5 1992), 279\u2013302.","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"146979_CR44","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. van Gelder","year":"1991","unstructured":"van Gelder, A., Ross, K. A. and Schlipf, J. S.: The well-founded semantics for general logic programs, J. ACM\n38 (1991), 620\u2013650.","journal-title":"J. ACM"},{"key":"146979_CR45","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00881833","volume":"10","author":"J.-H. You","year":"1993","unstructured":"You, J.-H. and Yuan, Li-Y.: Autoepistemic circumscription and logic programming, J. Automated Reasoning\n10 (1993), 143\u2013160.","journal-title":"J. Automated Reasoning"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005952908693.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1005952908693\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005952908693.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:25:52Z","timestamp":1749122752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1005952908693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["146979"],"URL":"https:\/\/doi.org\/10.1023\/a:1005952908693","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}