Algorithms for constructing decomposition sets in application to coarse-grained parallelization of SAT problems

In the paper algorithms for constructing decomposition sets in application to coarse-grained parallelization of SAT problems are suggested. These sets are used for solving SAT problems in distributed computing environments. Suggested algorithms are based on computing scheme of Monte-Carlo method.