The knowledge compiler also performs a static
information-flow analysis [Yin et al., 2000] for the online
DIARG algorithm. An information-flow relation I is
defined as a 3-tuple, , where Info
is the predicate name together with 0 or more arguments,
needers is a list of agents who might need to know such
information, and providers is a list of agents who might
know the information. We determine the needers of
information by analyzing the pre-conditions of operators
for which each agent might be responsible. And we
determine the potential providers of information by
analyzing the post-conditions of operators for which the
agents might be responsible. In particular, if P is a postcondition
of operator O, then we assume that an agent will
know P after executing O, since we can expect agents to
know the (direct) consequences of their own actions.