Skip to main content Accessibility help
×
Home

Default non-monotonic logic

  • Peter Mott (a1)

Abstract

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.

Copyright

References

Hide All
Barendregt, H 1981. Lambda Calculus, North Holland, Amsterdam.
Barwise, J and Etchmendy, J, 1987. Truth and the Liar, Oxford.
Barwise, J and Perry, J, 1983. Situations and Attitudes, MIT Press.
Bossu, G and Siegal, P, 1985. “Saturation, non-monotonic reasoning and the closed world assumption”, Artificial Intelligence (25) 1364.
Boolos, G and Jeffrey, R, 1982. Computability & Logic, Cambridge.
Blair, H A, 1982. “The recursion-theorectic complexity of the semantics of predicate logic as a programming language,” Information and Control (54) 2547.
Bridge, J, 1977. Beginning model theory, Oxford Logic Guides, Oxford.
Bundy, A, 1983. The Computer Modelling of Mathematical Reasoning, Academic Press, London.
Chang, C C and Keisler, H J, 1976. Model Theory, North-Holland.
Clark, K L, 1978. “Negation as failure,” In: Gallaire & Minker op cit 293.
Cohen, P, 1987. “The control of reasoning under uncertainty: a discussion of some programs,” The Knowledge Engineering Review (2) 625.
Davis, M, 1980. “The mathematics of non-monotonic reasoning,” Artificial Intelligence (13) 7380.
Etherington, D, Mercer, R and Reiter, R, 1985. “On the adequacy of predicate circumscription for closed world reasoning,” Computational Intelligence (1) (1985) 1115.
Fitting, M, 1985. “A Kripke-Kleene semantics for logic programs,” Journal of Logic Programming (4) 295312.
Fitting, M, 1986. “Notes on the mathematical aspects of Kripke's theory of truth,” Notre Dame Journal of Formal Logic (27) 7588.
Flannagan, T, 1986. “The consistency of negation as failure,” Journal of Logic Programming (3) 93115.
Gabbay, D, 1982. “Intuitionistic bases for non-monotonic logic,” In: Proc. Conference on Automated Deduction Springer Lecture Notes in Computer Science (6) 260273.
Gallaire, H and Minker, J, (Ed.), 1978. Logic and Databases, Plenum Press, New York.
Gibbins, P, 1988. Logic with Prolog (Oxford).
Hanks, S and McDermott, D, 1987. “Nonmonotonic logic and temporal projection,” Artificial Intelligence (33) 379412.
Hilpinen, R, (ed.), 1981. New Studies in Deontic Logic, North Holland, Amsterdam.
Hughes, G E and Cresswell, M, 1968. An Introduction to Modal Logic, Methuen, London.
Jaffar, J, Lassez, J-L and Lloyd, J W, 1983. “Completeness of the negation as failure rule,” Proceedings of the 8th IJCAI, Karlsruhe, 500506.
Konolige, K, 1988. “On the relation between default and autoepistemic logic,” Artificial Intelligence (35) 343382.
Kunen, K, 1987. “Negation in logic programming,” Journal of Logic Programming (4) 289308.
Kyburg, H, 1970. Probability and Inductive Logic, Macmillan, London.
Lifschitz, V, 1985a. “Closed world data bases and circumscription,” Artificial Intelligence (27) 229335.
Lifschitz, V, 1985b. “Pointwise circumscription: preliminary report,” Proc. IJCAI-85, Los Angeles, Ca., 406–10.
Lifschitz, V, 1986. “On the satisfiability of circumscription,” Artificial Intelligence (28) 1728.
Lloyd, J W, 1984. Foundations Of Logic Programming, Springer-Verlag, Berlin.
McCarthy, J, 1980. “Circumscription—a form of non-monotonic reasoning,” Artificial Intelligence (13) 2739.
McCarthy, J, 1986. “Applications of circumscription to formalising common-sense knowledge,” Artificial Intelligence (28) 89116.
McDermott, D V and Doyle, J, 1980. “Non-monotonic logic I,” Artificial Intelligence (13) 4172.
McDermot, D V, 1983. “Non-monotonic logic II,” JACM (29) 3357.
McDermott, D V, 1982. “A temporal logic for reasoning about processes and plans,” Cognitive Sci. (6) 101155.
Mendelson, E, 1987. Introduction to Mathematical Logic (3rd Edition), Wadsworth, California.
Minsky, M, 1975. “A framework for representing knowledge,” Winston, P (Ed.), The Psychology of Computer Vision McGraw Hill, New York.
Mill, J S, 1843. A System Of Logic.
Moore, R C, 1985. “Semantic considerations on non-monotonic logic,” Artificial Intelligence (25) 7594.
Mott, P L, 1987. “A theorem on the consistency of circumscription,” Artificial Intelligence (31) 8798.
Nute, D, 1988. “LDR: a logic for defeasible reasoning,” ACMC Research Report 01–0013, University of Georgia.
Perlis, D and Minker, J, 1986. “Completeness results for circumscription,” Artificial Intelligence (28) 2942.
Popper, K R, 1972. Objective Knowledge, OUP, London.
Raphael, B, 1971. “The frame problem in problem solving systems,” In: Findler, N V & Meltzer, B (Eds.), AI and Heuristic Programming, Edinburgh U P, Edinburgh.
Reiter, R, 1980a. “A logic for default reasoning,” Artificial Intelligence (13) 81132.
Reiter, R, 1980b. “Equality and domain closure in first order data bases,” JACM (27) 235249.
Reiter, R, 1978. “On closed world data bases,” In: Gallaire & Minker, op cit 5577.
Reiter, R, 1978b. “Deductive question answering on relational databases,” In: Gallaire and Minker, op cit 149177.
Reiter, R and Crisculo, G. 1983. “Some representational issues in default reasoning,” Int. J. of Computat. Maths (9) 113.
Rescher, N and Urquhart, A, 1971. Temporal Logic, Springer Verlag, Berlin.
Robbin, J W, 1969. Mathematical Logic, Benjamin, New York.
Schlipf, J, 1987a. “Decidability and definability with circumscription,” Annals of Pure and Applied Logic (35) 173191.
Schlipf, J, 1987b. “When is closed world reasoning tractable?” Department of Computer Science, University of Cincinati, Ohio 45221–0008, USA.
Shepherdson, J, 1984. “Negation as failure: a comparison of Clark's completed database and Reiter's closed world assumption,” Journal of Logic Programming (1) 5179.
Shepherdson, J, 1985. “Negation as failure II,” Journal of Logic Programming (2) 185202.
Shortliffe, E, 1976. Computer-Based Medical Consultations: MYCIN, Elsevier, New York.
Smets, Ph, Mamdani, E H, Dubois, D and Prade, H, 1988. Non-Standard Logics for Automated Reasoning, Academic Press, London.
Swinburne, R (Ed), 1974. The Justification of Induction, Oxford.
Tarski, A, 1944. “The semantic conception of truthPhilosophy & Phenomenological Research 4 341376.
Tarski, A, 1969a. Logic, Semantics, Metamathematics, Woodger, J H, (Ed.), Oxford.
Tarski, A, 1969b. “Truth and proof,” Scientific American 194 (6).
Turner, R, 1984. Logics for Artificial Intelligence, Ellis Horwood, New York.
Van Benthem, J, 1983. The Logic of Time, Reidel, Dordrecht.
Van Dalen, D, 1985. Logic and Structure, Springer, Berlin.
Van Gelder, A, Ross, K and Schlipf, J S, 1988. “Unfounded sets and well-founded semantics for general logic programs,” 7th ACM Principles of Database Systems.
Wojcik, M, 1987. “Methods of automatic reasoning using non-monotonic logics—examples of implementation”, Polish Academy of Sciences, ICS Report 610, Warsaw.

Related content

Powered by UNSILO

Default non-monotonic logic

  • Peter Mott (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.