Institute of Information Theories and Applications FOI ITHEA
The parallel resolution procedures based on graph structures method are presented. OR-, AND- and
DCDP- parallel inference on connection graph representation is explored and modifications to these algorithms
using heuristic estimation are proposed. The principles for designing these heuristic functions are thoroughly
discussed. The colored clause graphs resolution principle is presented. The comparison of efficiency (on the
Steamroller problem) is carried out and the results are presented. The parallel unification algorithm used in the
parallel inference procedure is briefly outlined in the final part of the paper.