Parallel inference on connection graphs

The paper presents a theoretical justification and description on the practical implementation of theorem proving problems in the first order predicate logic by using connection graphs. The basic definitions and concepts are given. Two types of parallelism in a process of a deductive inference are introduced. The sequential and parallel inference algorithms are described. The practical implementation of the sequential and parallel inference system is presented and analyzed. Examples of the theorem proving problems are discussed.