Parallelization of a Hyper-Linking–Based Theorem Prover

  • Authors:

  • Chih-Hung Wu;Shie-Jue Lee

  • Affiliations:

  • Department of Information Management, Shu-Te Institute of Technology, Kaohsiung, Taiwan 824. e-mail: johnw@mail.stit.edu.tw;Department of Electrical Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan 804. e-mail: leesj@ee.nsysu.edu.tw

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the parallelization of a first-order logic theorem prover that is based on the hyper-linking proof procedure (HLPP). Four parallel schemes – process level, clause level, literal level, and flow level – are developed for two types of sequential implementation of HLPP: list based and network based. The motivation for developing each parallel scheme is presented, and the architecture and implementation details of each scheme are described. Issues about parallel processing, such as serialization and synchronization, load balancing, and access conflicts, are examined. Speedups over sequential implementations are attained, and timing results for benchmark problems are provided.