Theorem proving in propositional logic on vector computers using a generalized Davis-Putnam procedure

Authors:
Wen-Tsuen Chen;Ming-Yi Fang
Affiliations:
Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China.;Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China.
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 7
Cited 1

A parallel approach for theorem proving in propositional logic

Information Sciences: an International Journal
Software for Supercomputers

Computer
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Parallel genetic algorithm to solve the satisfiability problem

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Davis-Putnam procedure (DPP) is an efficient and well-known method for solving the theorem proving problem in propositional logic. In this paper, we present an effective technique for vectorizing the DPP. To speed up the execution of DPP, the rules used by the procedure is first generalized by considering more than one literal at a time. Then vectorized algorithms based on the generalized rules are proposed. Experiments are conducted on vector computers. The results show the vectorized version of the Davis-Putnam procedure is effective in solving a variety of instances of theorem proving problem in propositional logic.