A simple distributed reasoning system for the connection calculus

We present a simple, distributed reasoning system for the first order logic, which applies a connection calculus as an inference method. The calculus has been proposed by Bibel as a generalization of some other popular approaches, like the tableau calculus or the resolution-based inference. The system is constructed in a lean deduction style and it has been inspired to some extent by a sequential reasoner leanCoP, implemented in Prolog. Our reasoner has a form of a relational program in the Oz language. In this programming model, a computational strategy is a parameter of a program having a form of a special object called a search engine. Therefore, the same program can be run in various ways, particularly in parallel on distributed machines. For this purpose, we use a parallel search engine available on the Mozart platform, which is a programming environment for Oz. We also describe results of experiments for estimating a speedup obtained by the distributed processing.