Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Chang, C.L., and Lee, R.C.T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.
Etherington, D.M., Relating Default Logic and Circumscription, Proc. 10th-IJCAI87, pp 489–494, 1987.
Imielinski, T., Results on Translating Defaults to Circumscription, Artificial Intelligence, 32, pp 131–146, 1987.
Lifschitz, V., Computing Circumscription, Proc. 9th IJCAI, Los Angeles, CA pp 121–127, 1985.
McCarthy, J., Circumscription — A Form of Non-Monotonic Reasoning, Artificial Intelligence, 13, pp 27–39, 1980.
McCarthy, J., Applications of Circumscription to Formalizing Common Sense Knowledge, Artificial Intelligence, 28, pp 89–116, 1986.
Reiter, R., On Closed World Data Bases, in: Logic and Databases, H. Gallaire and J. Minker, Eds., Plenum, New York, pp 56–76, 1978.
Reiter, R., A Logic for Default Reasoning, Artificial Intelligence, 13, pp 81–132, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Togashi, A., Hou, BH., Noguchi, S. (1990). Believability in default logic entails logical consequence from circumscription (sometimes). In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018386
Download citation
DOI: https://doi.org/10.1007/BFb0018386
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52850-0
Online ISBN: 978-3-540-47168-4
eBook Packages: Springer Book Archive