A NEW METHOD OF CIRCUMSCRIBING BELIEFS THE PROPOSITIONAL CASE

Article type: Research Article

Authors: Kundu, Sukhamay | Chen, Jianhua

Affiliations: Computer Science Department, Louisiana State University, Baton Rouge, LA 70803-4020, U.S.A., e-mail: [email protected], [email protected]

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.

Keywords: Belief-logic, circumscription, minimal models

DOI: 10.3233/FI-1997-29405

Journal: Fundamenta Informaticae, vol. 29, no. 4, pp. 383-390, 1997