A Computational Model of ersistent Beliefs

Sunju Park · 1996

The persistence of beliefs has been assumed in many research effotrs, either explicitly or implicitly, but a computational model is hard to find. For instance, in his well-known AOP article (Shoham 1993), Shoham suggests a formal language for beliefs and states that beliefs persist by default. The author writes (Be/A3 Be&‘O Like(A,B)7) means that at time 3 agent A believes that at time 10 agent B will believe that at time 7 A liked B. Shoham, however, does not elaborate on how to formally interpret the persistence of beliefs. Moreover, in his implemented agent language, AGENT-O, both the temporal aspect of beliefs (e.g., At time t, I believe...) and the nested beliefs (e.g., I believe you believe I believe...) have been omitted. In this abstract, we summarize our work on developing a computational model of persistent beliefs, which supports

Read the paper · More papers on PaperTik