|
|
|
|
|
The Parallel Theorem Proving Algorithm Based on Semi- Extension Rule |
|
PP: 119S-122S |
|
Author(s) |
|
Zhang Li-Ming,
Ouyang Dan-Tong,
Zhao Jian,
Bai Hong-Tao,
|
|
Abstract |
|
After a deep investigation on the maximum terms space of the clause set, the concept of
the partial maximum terms space of the clause set, which the maximum terms of the clause set
decomposed, is brought forward. By investigating the extension rule, this paper introduces the
concept of the satisfiability and the unsatisfiability of the partial maximum terms space, and gives an
algorithm determining the satisfiability of a partial space of the maximum terms - algorithm PSER
(Partial Semi-Extension Rule). Then, the TP problem is decomposed into several sub-problems
independent of each other, which can be solved by the given parallel computing method PPSER
(Parallel Partial Semi-Extension Rule). |
|
|
|
|
|