Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
