Design of a parallel theorem prover for first order logic

The design of a parallel theorem prover for first-order logic is described. The parallel theorem algorithm is based on the divide-and-conquer strategy. The concept of restricted substitution is used to reduce the number of ground clauses generated during the operation of this theorem prover. In this manner, the ground clause set generated by the theorem prover will be much smaller than that generated directly by Herbrand universe.<<ETX>>

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[3]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[4]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[5]  Robert A. Kowalski,et al.  A Proof Procedure Using Connection Graphs , 1975, JACM.

[6]  Wen-Tsuen Chen,et al.  A parallel approach for theorem proving in prepositional logic , 1987, Inf. Sci..

[7]  Larry Wos,et al.  Problems and Experiments for and with Automated Theorem-Proving Programs , 1976, IEEE Transactions on Computers.