Concurrent Resolution in Logic Programming Using Petri Net Models

The paper provides a new approach for automated reasoning in a logic program using extended Petri net models. 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 the 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.