The process of plan computing (or recomputing) is as follows:[3] The deliberative agent requires symbolic representation with compositional semantics (e. g. data tree) in all major functions, for its deliberation is not limited to present facts, but construes hypotheses about possible future states and potentially also holds information about past (i.e. memory).
[7] Such a provocative proposition must have become the object of serious criticism and raised a wide discussion, but the problem itself still remains unsolved in its merit until these days.
In 1988, Bratman, Israel and Pollack introduced Intelligent Resource-bounded Machine Architecture (IRMA), the first system implementing the Belief–Desire–Intention (BDI) software model.
[1] Above-mentioned troubles with symbolic AI have led to serious doubts about the viability of such a concept, which resulted in developing a reactive architecture, which is based on wholly different principles.
Reactive agents achieve their goals simply through reactions on changing environment, which implies reasonable computational modesty.
[8] It seems that classical deliberative agents may be usable especially where correct action is required, for their ability to produce optimal, domain-independent solution.