Believability in default logic entails logical consequence from circumscription (sometimes)
There have been a number of efforts, recently, towards developing default logic and circumscription, two important formalisms for non-monotonic reasoning. In this paper, we shall propose a partial translation of default logic to circumscription. We limit ourselves to an open default of the form, a(x):Mβ(x)/γ(x), whose justification β(x) contains no positive occurrences of a predicate. We show, under certain conditions, for a given default theory, any consistent extension is a logical consequence of the resulting circumscription.
Unable to display preview. Download preview PDF.
- [Chang and Lee, 1973]Chang, C.L., and Lee, R.C.T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.Google Scholar
- [Etherington, 1987]Etherington, D.M., Relating Default Logic and Circumscription, Proc. 10th-IJCAI87, pp 489–494, 1987.Google Scholar
- [Imielinski, 1987]Imielinski, T., Results on Translating Defaults to Circumscription, Artificial Intelligence, 32, pp 131–146, 1987.Google Scholar
- [Lifschitz, 1985]Lifschitz, V., Computing Circumscription, Proc. 9th IJCAI, Los Angeles, CA pp 121–127, 1985.Google Scholar
- [McCarthy, 1980]McCarthy, J., Circumscription — A Form of Non-Monotonic Reasoning, Artificial Intelligence, 13, pp 27–39, 1980.Google Scholar
- [McCarthy, 1986]McCarthy, J., Applications of Circumscription to Formalizing Common Sense Knowledge, Artificial Intelligence, 28, pp 89–116, 1986.Google Scholar
- [Reiter, 1978]Reiter, R., On Closed World Data Bases, in: Logic and Databases, H. Gallaire and J. Minker, Eds., Plenum, New York, pp 56–76, 1978.Google Scholar
- [Reiter, 1980]Reiter, R., A Logic for Default Reasoning, Artificial Intelligence, 13, pp 81–132, 1980.Google Scholar