By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wen-Tsuen Chen ; Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Ming-Yi Fang

The Davis-Putman procedure (DPP) is an efficient method for solving the theorem proving problem in propositional logic. The authors present an effective technique for vectorizing the DPP. To speed up the execution of DPP, the rules used by the procedure are 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 that the vectorized version of the Davis-Putnam procedure is effective in solving a variety of instances of the theorem proving problem in propositional logic. The vectorized version of the DPP was effective in cutting down the search space and thus substantially improving the search efficiency

Published in:

Supercomputing '90., Proceedings of

Date of Conference:

12-16 Nov 1990