{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:10:02Z","timestamp":1768435802593,"version":"3.49.0"},"reference-count":46,"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:1005900924623","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T00:10:48Z","timestamp":1040515848000},"page":"107-142","source":"Crossref","is-referenced-by-count":18,"title":["'Classical' Negation in Nonmonotonic Reasoning and Logic Programming"],"prefix":"10.1007","volume":"20","author":[{"given":"Jos\u00e9 J\u00falio","family":"Alferes","sequence":"first","affiliation":[]},{"given":"Lu\u00eds Moniz","family":"Pereira","sequence":"additional","affiliation":[]},{"given":"Teodor C.","family":"Przymusinski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"146978_CR1","unstructured":"Alferes, J. J., Dam\u00e1sio, C. V. and Pereira, L. M.: SLX \u2013 A top-down derivation procedure for programs with explicit negation, in M. Bruynooghe (ed.) International Symposium on Logic Programming, MIT Press, 1994."},{"key":"146978_CR2","unstructured":"Alferes, J. J. and Pereira, L. M.: On logic program semantics with two kinds of negation, in K. Apt (ed.), Int. Joint Conf. and Symp. on LP, MIT Press, 1992, pp. 574\u2013588."},{"key":"146978_CR3","doi-asserted-by":"crossref","unstructured":"Alferes, J. J. and Pereira, L. M.: Contradiction: when avoidance equal removal, in R. Dyckhoff (ed.), 4th Int. Ws. on Extensions of LP Vol. 798, LNAI, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58025-5_47"},{"key":"146978_CR4","doi-asserted-by":"crossref","unstructured":"Alferes, J. J. and Pereira, L.M.: Reasoning with Logic Programming Vol. 1111, LNAI, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61488-5"},{"key":"146978_CR5","doi-asserted-by":"crossref","unstructured":"Alferes, J. J. and Pereira, L. M.: Update-programs can update programs, in J. Dix, L. M. Pereira and T. Przymusinski (eds), Nonmonotonic Extensions of Logic Programming Vol. 1216, LNAI, Springer-Verlag, 1997.","DOI":"10.1007\/BFb0023804"},{"issue":"1\u20132","key":"146978_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1996-281201","volume":"28","author":"J. Alferes","year":"1996","unstructured":"Alferes, J., Pereira, L. and Przymusinski, T. C.: Belief revision in nonmonotonic reasoning and logic programming, Fundamenta Informaticae\n28(1\u20132) (1996), 1\u201322.","journal-title":"Fundamenta Informaticae"},{"key":"146978_CR7","first-page":"529","volume-title":"Principles of Knowledge Representation and Reasoning: Proc. Fifth 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. Fifth Int. Conf. (KR'96), Morgan Kaufmann, Boston, MA, San Francisco, CA, 1996, pp. 529\u2013541."},{"key":"146978_CR8","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 Press, New York, 1978, pp. 293\u2013322."},{"key":"146978_CR9","unstructured":"Dix, J.: A framework for representing and characterizing semantics of logic programs, in In B. Nebel, C. Rich, and W. Swartout (eds), 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 1992."},{"key":"146978_CR10","unstructured":"Dam\u00e1sio, C. V., Nejdl, W., Pereira, L. M. and Schroeder, M.: Model-based diagnosis preferences and strategies representation with logic meta-programming, in K. Apt and F. Turini (eds), Meta-logics and Logic Programming, MIT Press, 1995, pp. 311\u2013338."},{"key":"146978_CR11","doi-asserted-by":"crossref","unstructured":"Dam\u00e1sio, C. V. and Pereira, L. M.: Abduction over 3-valued extended logic programs, in V. Marek, A. Nerode and M. Truszczynski (eds), Proc. Third Int. Conf. on Logic Programming and Non-Monotonic Reasoning, LPNMR'95, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59487-6_3"},{"key":"146978_CR12","unstructured":"Dung, P. M. and Ruamviboonsuk, P.: Well founded reasoning with classical negation, in A. Nerode, W. Marek and V. S. Subrahmanian (eds), LP and NMR, MIT Press, 1991, pp. 120\u2013132."},{"key":"146978_CR13","series-title":"Technical report","volume-title":"Logic programming and reasoning with incomplete information","author":"M. Gelfond","year":"1992","unstructured":"Gelfond, M.: Logic programming and reasoning with incomplete information, Technical report, University of Texas at El Paso, 1992."},{"key":"146978_CR14","unstructured":"Gelfond, M. and Lifschitz, V.: The stable model semantics for logic programming, in R. Kowalski and K. Bowen (eds), Proceedings of the Fifth Logic Programming Symposium, Cambridge, Mass., 1988, pp. 1070\u20131080. Association for Logic Programming, MIT Press."},{"key":"146978_CR15","unstructured":"Gelfond, M. and Lifschitz, V.: Logic programs with classical negation, in Proc. Seventh Int. Logic Programming Conference, Jerusalem, Israel, Cambridge, Mass., 1990, pp. 579\u2013597. Association for Logic Programming, MIT Press."},{"key":"146978_CR16","unstructured":"Gelfond, M. and Lifschitz, V.: Representing actions in extended logic programs, in K. Apt (ed.), Int. Joint Conf. and Symp. on LP, MIT Press, 1992, pp. 559\u2013573."},{"issue":"1","key":"146978_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"Gelfond, M., Przymusinski, H. and Przymusinski, T. C.: On the relationship between circumscription and negation as failure. J. Artificial Intelligence\n38(1) (1989), 75\u201394.","journal-title":"J. Artificial Intelligence"},{"issue":"3","key":"146978_CR18","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(3) (1991), 620\u2013650.","journal-title":"J. ACM"},{"key":"146978_CR19","unstructured":"Katsuno, H. and Mendelzon, A. O.: On the difference between updating a knowledge base and revising it, in Proc. KR-91, 1991, pp. 387\u2013394."},{"key":"146978_CR20","doi-asserted-by":"crossref","unstructured":"Kowalski, R.: Problems and promises of computational logic, in John Lloyd (ed.), Computational Logic, Basic Research Series, Springer-Verlag, 1990, pp. 1\u201336.","DOI":"10.1007\/978-3-642-76274-1_1"},{"key":"146978_CR21","doi-asserted-by":"crossref","unstructured":"Kowalski, R.: Legislation as logic programs, in Logic Programming in Action, Springer-Verlag, 1992, pp. 203\u2013230.","DOI":"10.1007\/3-540-55930-2_15"},{"key":"146978_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription \u2013 a form of nonmonotonic reasoning, J. Artificial Intelligence\n13 (1980), 27\u201339.","journal-title":"J. Artificial Intelligence"},{"key":"146978_CR23","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume-title":"Proc. 6th Conference on Automated Deduction","author":"J. Minker","year":"1982","unstructured":"Minker, J.: On indefinite data bases and the closed world assumption, in Proc. 6th Conference on Automated Deduction, Springer Verlag, New York, 1982, pp. 292\u2013308."},{"key":"146978_CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. C. Moore","year":"1985","unstructured":"Moore, R. C.: Semantic considerations on nonmonotonic logic, J. Artificial Intelligence\n25 (1985), 75\u201394.","journal-title":"J. Artificial Intelligence"},{"key":"146978_CR25","unstructured":"Marek, W. and Truszczynski, M.: Non-Monotonic Logic, Springer-Verlag, 1994."},{"key":"146978_CR26","unstructured":"Marek, W. and Truszczy\u0144ski, M.: Revision specifications by means of revision programs, in Logics in AI. Proceedings of JELIA' 94, Lecture Notes in Artificial Intelligence, Springer-Verlag, 1994."},{"key":"146978_CR27","doi-asserted-by":"crossref","first-page":"16","DOI":"10.2307\/2268973","volume":"14","author":"D. Nelson","year":"1949","unstructured":"Nelson, D.: Constructible falsity, J. Symbolic Logic\n14 (1949), 16\u201326.","journal-title":"J. Symbolic Logic"},{"key":"146978_CR28","unstructured":"Pereira, L. M. and Alferes, J. J.: Well founded semantics for logic programs with explicit negation, in B. Neumann (ed.), European Conf. on AI, John Wiley and Sons, 1992, pp. 102\u2013106."},{"issue":"2\u20134","key":"146978_CR29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0743-1066(93)90032-C","volume":"17","author":"L. M. Pereira","year":"1993","unstructured":"Pereira, L. M., Apar\u00edcio, J. N. and Alferes, J. J.: Nonmonotonic reasoning with logic programming, J. Logic Programming, Special Issue on Nonmonotonic Reasoning\n17(2\u20134) (1993), 227\u2013263.","journal-title":"J. Logic Programming, Special Issue on Nonmonotonic Reasoning"},{"key":"146978_CR30","doi-asserted-by":"crossref","unstructured":"Pereira, L. M., Dam\u00e1sio, C. and Alferes, J. J.: Debugging by diagnosing assumptions, in P. A. Fritzson (ed.), Automatic Algorithmic Debugging, AADEBUG'93 Vol. 749 Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 58\u201374.","DOI":"10.1007\/BFb0019400"},{"key":"146978_CR31","doi-asserted-by":"crossref","unstructured":"Pereira, L. M., Dam\u00e1sio, C. and Alferes, J. J.: Diagnosis and debugging as contradiction removal, in L. M. Pereira and A. Nerode (eds), 2nd Int. Ws. on LP and NMR, MIT Press, 1993, pp. 316\u2013330.","DOI":"10.7551\/mitpress\/4307.003.0026"},{"key":"146978_CR32","doi-asserted-by":"crossref","unstructured":"Pearce, D.: Reasoning with negative information II: Hard negation, strong negation and logic programs, in D. Pearce and H. Wansing (eds), Nonclassical Logics and Information Processing, Springer-Verlag, 1990, pp. 63\u201379.","DOI":"10.1007\/BFb0031924"},{"issue":"4","key":"146978_CR33","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. C. Przymusinski","year":"1990","unstructured":"Przymusinski, T. C.: The well-founded semantics coincides with the three-valued stable semantics, Fundamenta Informaticae\n13(4) (1990), 445\u2013464.","journal-title":"Fundamenta Informaticae"},{"key":"146978_CR34","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. C. Przymusinski","year":"1991","unstructured":"Przymusinski, T. C.: 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. Seventh Int. Logic Programming Conference, Jerusalem, MIT Press, 1990, pp. 459\u2013477.)","journal-title":"New Generation Computing Journal"},{"key":"146978_CR35","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C.: Semantics of normal and disjunctive logic programs: A unifying framework, in J. Dix, L. Pereira, and T. Przymusinski (eds), Proc. Workshop on Non-Monotonic Extensions of Logic Programming at the Eleventh International Logic Programming Conference, ICLP'95, Santa Margherita Ligure, Italy, June 1994, Springer Verlag, 1995, pp. 43\u201367.","DOI":"10.1007\/BFb0030659"},{"key":"146978_CR36","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01530826","volume":"14","author":"T. C. Przymusinski","year":"1995","unstructured":"Przymusinski, T. C.: Static semantics for normal and disjunctive logic programs, Annals of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs 14, 1995, pp. 323\u2013357.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"146978_CR37","volume-title":"Autoepistemic logic of knowledge and beliefs","author":"T. C. Przymusinski","year":"1997","unstructured":"Przymusinski, T. C.: Autoepistemic logic of knowledge and beliefs, In preparation, University of California at Riverside, 1997. (Extended abstract appeared in 'A knowledge representation framework based on autoepistemic logic of minimal beliefs' In Proc. Twelfth National Conference on Artificial Intelligence, AAAI-94, Seattle, Washington, August 1994, Los Altos, CA, 1994, pp. 952\u2013959. American Association for Artificial Intelligence, Morgan Kaufmann.)"},{"key":"146978_CR38","volume-title":"Plain negation as a basis for strong, weak and classical negations","author":"T. C. Przymusinski","year":"1997","unstructured":"Przymusinski, T. C.: Plain negation as a basis for strong, weak and classical negations, In preparation, University of California at Riverside, 1997."},{"key":"146978_CR39","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C. and, Turner, H.: Update by means of inference rules, in A. Nerode (ed.), Proc. Third Int. Conf. on Logic Programming and Non-Monotonic Reasoning, Lexington, KY, LPNMR'95, Springer Verlag, 1995, pp. 156\u2013174.","DOI":"10.1007\/3-540-59487-6_12"},{"key":"146978_CR40","unstructured":"Pearce, D. and Wagner, G.: Reasoning with negative information I: Strong negation in logic programs, in L. Haaparanta, M. Kusch and I. Niiniluoto (eds), Language, Knowledge and Intentionality, Acta Philosophica Fennica 49, 1990, pp. 430\u2013453."},{"key":"146978_CR41","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"Reiter, R.: On closed-world data bases, in H. Gallaire and J. Minker (eds), Logic and Data Bases, Plenum Press, New York, 1978, pp. 55\u201376."},{"key":"146978_CR42","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default theory, J. Artificial Intelligence\n13 (1980), 81\u2013132.","journal-title":"J. Artificial Intelligence"},{"key":"146978_CR43","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02121118","volume":"36","author":"D. Vakarelov","year":"1977","unstructured":"Vakarelov, D.: Notes on n-lattices and constructive logic with strong negation, Studia Logica\n36 (1977), 109\u2013125.","journal-title":"Studia Logica"},{"key":"146978_CR44","doi-asserted-by":"crossref","unstructured":"van Gelder, A., Ross, K. A. and Schlipf, J. S.: The well-founded semantics for general logic programs, J. ACM, 1990, (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, 1988, pp. 221\u2013230.","DOI":"10.1145\/308386.308444"},{"key":"146978_CR45","doi-asserted-by":"crossref","unstructured":"Wagner, G.: Reasoning with inconsistency in extended deductive databases, in L. M. Pereira and A. Nerode (eds), 2nd Int. Ws. on LP and NMR, pages 300\u2013315. MIT Press, 1993, pp. 300\u2013315.","DOI":"10.7551\/mitpress\/4307.003.0025"},{"key":"146978_CR46","unstructured":"Winslett, M.: Reasoning about action using a possible models approach, in Proc. AAAI\u201388, 1988, pp. 89\u201393."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005900924623.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1005900924623\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005900924623.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:24:52Z","timestamp":1749122692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1005900924623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["146978"],"URL":"https:\/\/doi.org\/10.1023\/a:1005900924623","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}