Conditioned Circumscription: Translating Defaults to Circumscription
In this article a new form of circumscription, called conditioned circumscription is developed, that permits translating arbitrary defaults to circumscription. As a consequence the deduction methods of first-order predicate logic can be applied to default logic. The circumscription policy will be fixed and by showing the equivalence of conditioned circumscription and the corresponding default theory a model-theoretic semantics for default logic is presented.
Unable to display preview. Download preview PDF.
- [BM89]M. Bauer and G. Merziger. Conditioned Circumscription: Translating Defaults to Circumscription. Memo 34, Universität des Saarlandes, 1989.Google Scholar
- [Bre89]Gerhard Brewka. Nonmonotonic Reasoning — From Theoretical Foundations Towards Efficient Computation. PhD thesis, Universität Hamburg, 1989.Google Scholar
- [Gro84]Benjamin Grosof. Default reasoning as circumscription. In Non-Monotonic Reasoning Workshop, New Paltz, pages 115–124, 1984.Google Scholar
- [Lif85]Vladimir Lifschitz. Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121–127, 1985.Google Scholar
- [Lif87]Vladimir Lifschitz. Pointwise circumscription. In Matthew L. Ginsberg, editor, Readings in Nonmonotonic Reasoning, pages 179–193, Morgan Kaufmann, Los Altos, California, 1987.Google Scholar
- [Luk84]Witold Lukaszewicz. Considerations on default logic. In Non-Monotonic Reasoning Workshop, New Paltz, pages 165–193, 1984.Google Scholar
- [Sch87]Karl Schlechta. Defaults, preorder semantics and circumscription. 1987. (unpublished)Google Scholar