Search

The paper provides a new approach to designing a massively parallel logic engine for automated reasoning in a distributed decision support system. The design includes extension of classical linear resolution of first order logic clauses by multi-resolution, where a set of clauses can be resolved concurrently without sacrificing any inference, thereby speeding-up the execution of a logic program. The speed-up and utilization rate of resources are used as the performance evaluation metric to compare the performance of the proposed system with the classical one. A high level logic architecture of the proposed multi-resolution system is presented to explore possible parallelism and pipelining among the tasks, thus determining the execution time of typical logic programs. Possible application of the proposed system in query evaluation of a logic program based database systems is also introduced.

The paper provides a new approach to designing a massively parallel logic engine for automated reasoning in a distributed decision support system. The design includes extension of classical linear resolution of first order logic clauses by multi-resolution, where a set of clauses can be resolved concurrently without sacrificing any inference, thereby speeding-up the execution of a logic program. The speed-up and utilization rate of resources are used as the performance evaluation metric to compare the performance of the proposed system with the classical one. A high level logic architecture of the proposed multi-resolution system is presented to explore possible parallelism and pipelining among the tasks, thus determining the execution time of typical logic programs. Possible application of the proposed system in query evaluation of a logic program based database systems is also introduced.