The Parallel Theorem Proving Algorithm Based on Semi-Extension Rule

被引：0

作者：

Zhang Li-Ming ^{[1
,2
]}

Ouyang Dan-Tong ^{[1
,2
]}

Zhao Jian ^{[1
,2
]}

Bai Hong-Tao ^{[1
,2
,3
]}

机构：

[1] Jilin Univ, Sch Comp Sci & Technol, Changchun 130012, Peoples R China

[2] Jilin Univ, Minist Educ, Key Lab Symbol Computat & Knowledge Engn, Changchun 130012, Peoples R China

[3] Jilin Univ, Ctr Comp Fundamental Educ, Changchun 130012, Peoples R China

来源：

APPLIED MATHEMATICS & INFORMATION SCIENCES | 2012年 / 6卷

关键词：

Theorem Proving; Parallel Algoritm; Extension Rule; GENERATION;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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).

引用

页码：119 / 122

页数：4

共 24 条

[1] TAME: Using PVS strategies for special-purpose theorem proving [J].