From Knowledge-Based Programs to Graded Belief-Based Programs Part I: On-Line Reasoning

Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at execution time. However, branching conditions in KBPs cannot refer to possibly erroneous beliefs or to graded belief, such as “if my belief that ϕ holds is high then do some action α else perform some sensing action β”. The purpose of this paper is to build a framework where such programs can be expressed. In this paper we focus on the execution of such a program (a companion paper investigates issues relevant to the off-line evaluation and construction of such programs). We define a simple graded version of doxastic logic KD45 as the basis for the definition of belief-based programs. Then we study the way the agent’s belief state is maintained when executing such programs, which calls for revising belief states by observations (possibly unreliable or imprecise) and progressing belief states by phys...

• Type: Conference
• Year: 2004
• Where: ECAI
• Authors: Noël Laverny, Jérôme Lang
• Keywords: Agent’s Belief State, Artificial Intelligence, Belief States, Branching Conditions, ECAI 2004