Performance analysis of a message-oriented knowledge-base

A message-driven model for function-free Horn logic is presented, where the knowledge base is represented as a network of logical processing elements communicating with one another exclusively through messages. The lack of centralized control and centralized memory makes this model suitable for implementation on highly parallel asynchronous computer architecture. The performance of this message-driven system is analyzed and compared to that of a sequential resolution scheme using backtracking. Closed-form expressions for both approaches are derived.<
>