A new method of circumscribing beliefs the propositional case
Document Type
Article
Publication Date
1-1-1997
Abstract
We propose here a new notion of a minimal model for forming circumscription in belief-logic by incorporating the notion of minimal models in the prepositional logic. This results in a new circumscription operation for belief-formulas than the one considered in [4-6]. An important feature of the new circumscription operation is its close relationship with the circumscription of prepositional formulas. For instance, we have CIRC[Bφ] = B(CIRC[φ]), where φ is a prepositional formula. We give several examples to show that the new notion of circumscription fits quite well with intuition.
Publication Source (Journal or Book title)
Fundamenta Informaticae
First Page
383
Last Page
390
Recommended Citation
Kundu, S., & Chen, J. (1997). A new method of circumscribing beliefs the propositional case. Fundamenta Informaticae, 29 (4), 383-390. https://doi.org/10.3233/fi-1997-29405