Belief Revision in a Fact-Rule Agent’s Belief Base

Plan-belief Revision in Jason

“…We have built on the work presented in (Alechina et al, 2006a;Alechina et al, 2006b;Nguyen, 2009) by focusing on how plans can be added dynamically (either by being exchanged or derived) and has shown that this has practical use in Jason, because of its extensible nature.…”

“…A reason for this is that the plans of an agent is usually a part of a plan library that is assumed to be correct and unlikely to be modified. However, as described in (Nguyen, 2009), this is not always the case. In fact, even if a derived belief (Q) turns out to be wrong, this should not necessarily mean that any of the supporting beliefs (P 1 ,... ,P n ) are wrong; it may just be wrong to conclude Q from them (i.e.…”

“…It is now possible to order beliefs using a total preference order relation, , on a set of beliefs (Nguyen, 2009). Given two beliefs, P and Q, we write P Q if Q is preferred over P. This is the case if p(P) < p(Q).…”

“…It is clear that non-inferential justifications must have some kind of a priori quality. In (Nguyen, 2009) the following order of independent beliefs is suggested:…”

“…In (Nguyen, 2009) the algorithm for literals was extended to include contraction by rules. Our aim is to show practical uses of the algorithm.…”