{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:27:52Z","timestamp":1767637672387,"version":"3.48.0"},"reference-count":66,"publisher":"Maximum Academic Press","issue":"4","license":[{"start":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T00:00:00Z","timestamp":1246924800000},"content-version":"unspecified","delay-in-days":7523,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[1988,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper is a review of certain non-monotonic logics, which I call default non-monotonic logics. These are logics which exploit failure to prove. How each logic uses this basic idea is explained, and examples given. The emphasis is on leading ideas explained through examples: technical detail is avoided. Four non-monotonic logics are discussed: Reiter's default logic, McCarthy's circumscription, McDermott's modal non-monotonic logic, and Clarks's completed database. The first two are treated in some detail. The recent Hanks-McDermott criticism of non-monotonic logic is discussed, and some conclusions drawn about the prospects for non-monotonic logic. Recommendations for further reading are given.<\/jats:p>","DOI":"10.1017\/s0269888900004586","type":"journal-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T09:36:34Z","timestamp":1246959394000},"page":"265-284","source":"Crossref","is-referenced-by-count":0,"title":["Default non-monotonic logic"],"prefix":"10.48130","volume":"3","author":[{"given":"Peter","family":"Mott","sequence":"first","affiliation":[]}],"member":"27968","published-online":{"date-parts":[[2009,7,7]]},"reference":[{"key":"S0269888900004586_ref042","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90029-9"},{"volume-title":"AI and Heuristic Programming","year":"1971","author":"Raphael","key":"S0269888900004586_ref044"},{"key":"S0269888900004586_ref027","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90055-4"},{"key":"S0269888900004586_ref038","unstructured":"Mill J S , 1843. A System Of Logic."},{"volume-title":"Probability and Inductive Logic","year":"1970","author":"Kyburg","key":"S0269888900004586_ref026"},{"key":"S0269888900004586_ref039","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90042-6"},{"volume-title":"The Psychology of Computer Vision","year":"1975","author":"Minsky","key":"S0269888900004586_ref037"},{"key":"S0269888900004586_ref036","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7288-6"},{"key":"S0269888900004586_ref033","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90012-0"},{"key":"S0269888900004586_ref030","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6"},{"key":"S0269888900004586_ref028","unstructured":"Lifschitz V , 1985b. \u201cPointwise circumscription: preliminary report,\u201d Proc. IJCAI-85, Los Angeles, Ca., 406\u201310."},{"key":"S0269888900004586_ref019","unstructured":"Gibbins P , 1988. Logic with Prolog (Oxford)."},{"key":"S0269888900004586_ref024","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90021-5"},{"key":"S0269888900004586_ref025","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(87)90007-0"},{"volume-title":"An Introduction to Modal Logic","year":"1968","author":"Hughes","key":"S0269888900004586_ref022"},{"volume-title":"Logics for Artificial Intelligence","year":"1984","author":"Turner","key":"S0269888900004586_ref062"},{"key":"S0269888900004586_ref034","first-page":"33","article-title":"Non-monotonic logic II","author":"McDermot","year":"1983","journal-title":"JACM"},{"key":"S0269888900004586_ref010","doi-asserted-by":"crossref","unstructured":"Clark K L , 1978. \u201cNegation as failure,\u201d In: Gallaire & Minker op cit 293.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"S0269888900004586_ref014","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(85)80005-4"},{"key":"S0269888900004586_ref017","doi-asserted-by":"crossref","unstructured":"Gabbay D , 1982. \u201cIntuitionistic bases for non-monotonic logic,\u201d In: Proc. Conference on Automated Deduction Springer Lecture Notes in Computer Science (6) 260\u2013273.","DOI":"10.1007\/BFb0000064"},{"key":"S0269888900004586_ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-8484-4"},{"key":"S0269888900004586_ref046","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322189"},{"volume-title":"Beginning model theory","year":"1977","author":"Bridge","key":"S0269888900004586_ref007"},{"volume-title":"Lambda Calculus","year":"1981","author":"Barendregt","key":"S0269888900004586_ref001"},{"key":"S0269888900004586_ref035","doi-asserted-by":"publisher","DOI":"10.1207\/s15516709cog0602_1"},{"key":"S0269888900004586_ref029","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90028-7"},{"key":"S0269888900004586_ref004","doi-asserted-by":"crossref","unstructured":"Bossu G and Siegal P , 1985. \u201cSaturation, non-monotonic reasoning and the closed world assumption\u201d, Artificial Intelligence (25) 13\u201364.","DOI":"10.1016\/0004-3702(85)90040-2"},{"key":"S0269888900004586_ref040","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90082-8"},{"key":"S0269888900004586_ref013","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1985.tb00055.x"},{"volume-title":"Situations and Attitudes","year":"1983","author":"Barwise","key":"S0269888900004586_ref003"},{"key":"S0269888900004586_ref063","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-9868-7"},{"volume-title":"Truth and the Liar","year":"1987","author":"Barwise","key":"S0269888900004586_ref002"},{"volume-title":"ACMC Research Report 01\u20130013","year":"1988","author":"Nute","key":"S0269888900004586_ref041"},{"volume-title":"Model Theory","year":"1976","author":"Chang","key":"S0269888900004586_ref009"},{"key":"S0269888900004586_ref031","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90011-9"},{"volume-title":"The Computer Modelling of Mathematical Reasoning","year":"1983","author":"Bundy","key":"S0269888900004586_ref008"},{"volume-title":"Computability and Logic","year":"1982","author":"Boolos","key":"S0269888900004586_ref005"},{"key":"S0269888900004586_ref012","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90013-2"},{"key":"S0269888900004586_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(86)90017-8"},{"volume-title":"Objective Knowledge","year":"1972","author":"Popper","key":"S0269888900004586_ref043"},{"volume-title":"Logic and Databases","year":"1978","author":"Gallaire","key":"S0269888900004586_ref018"},{"key":"S0269888900004586_ref020","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90043-9"},{"key":"S0269888900004586_ref047","doi-asserted-by":"crossref","unstructured":"Reiter R , 1978. \u201cOn closed world data bases,\u201d In: Gallaire & Minker, op cit 55\u201377.","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"S0269888900004586_ref048","doi-asserted-by":"crossref","unstructured":"Reiter R , 1978b. \u201cDeductive question answering on relational databases,\u201d In: Gallaire and Minker, op cit 149\u2013177.","DOI":"10.1007\/978-1-4684-3384-5_6"},{"volume-title":"Logic and Structure","year":"1985","author":"Van Dalen","key":"S0269888900004586_ref064"},{"key":"S0269888900004586_ref049","first-page":"1","article-title":"Some representational issues in default reasoning","author":"Reiter","year":"1983","journal-title":"Int. J. of Computat. Maths"},{"volume-title":"Mathematical Logic","year":"1969","author":"Robbin","key":"S0269888900004586_ref051"},{"key":"S0269888900004586_ref023","unstructured":"Jaffar J , Lassez J-L and Lloyd J W , 1983. \u201cCompleteness of the negation as failure rule,\u201d Proceedings of the 8th IJCAI, Karlsruhe, 500\u2013506."},{"key":"S0269888900004586_ref052","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(87)90062-5"},{"key":"S0269888900004586_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91234-7"},{"key":"S0269888900004586_ref054","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90023-2"},{"key":"S0269888900004586_ref011","first-page":"6","article-title":"The control of reasoning under uncertainty: a discussion of some programs","author":"Cohen","year":"1987","journal-title":"The Knowledge Engineering Review"},{"key":"S0269888900004586_ref053","unstructured":"Schlipf J , 1987b. \u201cWhen is closed world reasoning tractable?\u201d Department of Computer Science, University of Cincinati, Ohio 45221\u20130008, USA."},{"key":"S0269888900004586_ref066","unstructured":"Wojcik M , 1987. \u201cMethods of automatic reasoning using non-monotonic logics\u2014examples of implementation\u201d, Polish Academy of Sciences, ICS Report 610, Warsaw."},{"key":"S0269888900004586_ref032","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90032-9"},{"key":"S0269888900004586_ref055","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(85)90018-4"},{"volume-title":"Computer-Based Medical Consultations: MYCIN","year":"1976","author":"Shortliffe","key":"S0269888900004586_ref056"},{"volume-title":"Non-Standard Logics for Automated Reasoning","year":"1988","author":"Smets","key":"S0269888900004586_ref057"},{"volume-title":"The Justification of Induction","year":"1974","author":"Swinburne","key":"S0269888900004586_ref058"},{"key":"S0269888900004586_ref059","doi-asserted-by":"publisher","DOI":"10.2307\/2102968"},{"volume-title":"Logic, Semantics, Metamathematics","year":"1969","author":"Tarski","key":"S0269888900004586_ref060"},{"key":"S0269888900004586_ref065","doi-asserted-by":"crossref","unstructured":"Van Gelder A , Ross K and Schlipf J S , 1988. \u201cUnfounded sets and well-founded semantics for general logic programs,\u201d 7th ACM Principles of Database Systems.","DOI":"10.1145\/308386.308444"},{"key":"S0269888900004586_ref015","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093636525"},{"key":"S0269888900004586_ref050","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-7664-1"},{"key":"S0269888900004586_ref061","article-title":"Truth and proof","volume":"194","author":"Tarski","year":"1969","journal-title":"Scientific American"},{"key":"S0269888900004586_ref045","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90014-4"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888900004586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:03Z","timestamp":1767624123000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888900004586\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["S0269888900004586"],"URL":"https:\/\/doi.org\/10.1017\/s0269888900004586","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}