A New Method Of Circumscribing Beliefs The Propositional Case

  • Authors:
  • Sukhamay Kundu;Jianhua Chen

  • Affiliations:
  • Computer Science Department, Louisiana State University, Baton Rouge, LA 70803-4020, U.S.A., e-mail: kundu@bit.csc.lsu.edu, jianhua@bit.csc.lsu.edu;Computer Science Department, Louisiana State University, Baton Rouge, LA 70803-4020, U.S.A., e-mail: kundu@bit.csc.lsu.edu, jianhua@bit.csc.lsu.edu

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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&phgr;] = B(CIRC[&phgr;]), where &phgr; is a prepositional formula. We give several examples to show that the new notion of circumscription fits quite well with intuition.