The architecture of a Cooperative Expert System (CES) that behaves as a finite automata is presented, that is to say, it is a
quintuple where G is the set of knowledge bases Gj, M is the set of messages, CT is in state of
transition, function λ which in this case is a communication protocol represented by a matrix or Communication Table (CT)
and with which can pass from one Knowledge Base (KB) to another, these elements behave as the automata’s states, Gj is
the initial KB determined by an enunciated source given by the user, and finally, K is the set of selected KB’s or candidates
to consultation. In the case of the finite automata, the set K comes to be the set of final states. All the Knowledge Bases that
visit one have a common working area where the results of the inferences are read and deposited, this way the Expert
Systems which cooperate in a consultation utilise those data without having to ask the user.
|