On parallelism of hyper-linking theorem proving: a preliminary report
暂无分享,去创建一个
This paper exploits the parallelism of a hyper-linking based theorem prover. We analyze the unique properties of the the hyper-linking proof procedure and present the preliminary results. With respect to these properties four parallel strategies, phase-level, clause-level, literal-level, search level parallelism are designed for different implementation schemes of the prover. Results and analysis of the experiments on these parallel strategies are presented.
[1] Hidehiko Tanaka,et al. A Parallel Inference Machine , 1986, Computer.
[2] Charles L. Forgy,et al. Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..