Drew McDermott
- 1 BOOLOS, G The Unprovabdtfy of Consistency Cambridge UmversJty Press, Cambridge, England, 1979Google Scholar
- 2 DOYLE, J. A truth maintenance system Memo 521, M I.T. Artificial Intelligence Lab, Cambridge, Mass, 1979Google Scholar
- 3 GOEDEL, K What is Cantor's continuum problem~ Amer Math Monthly 54 (1947), 515-525 Also in Philosophy of Mathematics Selected Readings, P Benacerraf and H. Putnam, Eds, Prenttce-HaU, Englewood Chffs, N J , pp 258-273Google Scholar
- 4 HIEwITI, C Description and theoretical analysts (using schemata) of PLANNER A language for proving theorems and mantpulatmg models in a robot Tech Rep 258, M,i T ArUficml Intelhgence Lab, Cambridge, Mass., 1972Google Scholar
- 5 HINTIKKA, J. Knowledge and Belief Cornell University Press, Ithaca, N.Y., 1962Google Scholar
- 6 HUGHES, G E., AND CRESSW~LL, M.J. An Introduction to Modal Logtc Methuen and Co., London,1972.Google Scholar
- 7 McCARTHY J Ctrcumscnptton" A ncnmonotom~ reference rule Artf lnlell 13, 1, 2 (1980), 27-40Google Scholar
- 8 McDeRMOTT, D V, AND DOYLE, J. Non-monotontc logic I. Arttf Intell. 13, 1, 2 (1980), 41-72Google Scholar
- 9 MOORE, R. Reasoning about knowledge and action Ph.D. Dissertation, M.I T, Cambridge, Mass, 1979.Google Scholar
- 10 REITER, R. A logic for default reasoning Artf lntell 13, I, 2 (1980), 81-132.Google Scholar
- 11 RESCHER, N, ANO UrtQUHART, A Temporal Logic Spnnger-Verlag, New York, 1971.Google Scholar
- 12 ROBINSON, J.A A machine-oriented logic based on the resoluuon prmclple. J ACM 12, I (Jan 1965), 23--41 Google Scholar
- 13 TUKEY, J. Conclusions vs. decisions. Technometrtcs 2 (1960), 423--2133.Google Scholar
- 14 WEYHRAUCH, R Prolegomena to a theory of formal reasontng Artif. lntell. 13, 1, 2 (1980), 133-170.Google Scholar
- 15 WINOGRAD, T Extended reference modes in reasoning by computer systems. Amf Intdl. 13, 1, 2 (1980), 5-26.Google Scholar
Index Terms
- Nonmonotonic Logic II: Nonmonotonic Modal Theories
Recommendations
Ground Nonmonotonic Modal Logic S5: New Results
We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T ...
Only-knowing meets nonmonotonic modal logic
KR'12: Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and ReasoningOnly-knowing was originally introduced by Levesque to capture the beliefs of an agent in the sense that its knowledge base is all the agent knows. When a knowledge base contains defaults Levesque also showed an exact correspondence between only-knowing ...
‘Classical’ Negation in Nonmonotonic Reasoning and Logic Programming
Gelfond and Lifschitz were the first to point out the need for a symmetric negation in logic programming and they also proposed a specific semantics for such negation for logic programs with the stable semantics, which they called ‘classical’. Subsequently,...
Comments