no code implementations • 15 Jan 2014 • Kaile Su, Abdul Sattar, Guanfeng Lv, Yan Zhang
Given a background knowledge base and a set of observable variables for each agent, we show that the notion of an agent knowing a formula can be defined as a weakest sufficient condition of the formula under background knowledge base.
