Parallelization of a Hyper-Linking–Based Theorem Prover

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.

[1]  Maria Paola Bonacina,et al.  Distributed Deduction by Clause-Diffusion: Distributed Contraction and the Aquarius Prover , 1995, J. Symb. Comput..

[2]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[3]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[4]  Jörg Denzinger,et al.  Recording and Analysing Knowledge-Based Distributed Deduction Processes , 1996, J. Symb. Comput..

[5]  Harvey M. Deitel,et al.  An introduction to operating systems , 1984 .

[6]  Robert A. Meyer,et al.  DARES: A Distributed Automated REasoning System , 1990, AAAI.

[7]  Andreas Wolf.  p-SETHEO: Strategy Parallelism in Automated Theorem Proving , 1998, TABLEAUX.

[8]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[9]  Salvatore J. Stolfo,et al.  Architecture and Applications of DADO: A Large-Scale Parallel Computer for Artificial Intelligence , 1983, IJCAI.

[10]  Francis Jeffry Pelletier,et al.  Seventy-five problems for testing automatic theorem provers , 1986, Journal of Automated Reasoning.

[11]  Allen Newell,et al.  Parallel algorithms and architectures for rule-based systems , 1986, ISCA '86.

[12]  Anoop Gupta.  Parallelism in production systems , 1987 .

[13]  Soumitra Bose,et al.  Parthenon: A parallel theorem prover for non-horn clauses , 2004, Journal of Automated Reasoning.

[14]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[15]  Allen Newell,et al.  Parallel algorithms and architectures for rule-based systems , 1986, ISCA '86.

[16]  Christian B. Suttner.  SPTHEO - A Parallel Theorem Prover , 2004, Journal of Automated Reasoning.

[17]  Alberto M. Segre,et al.  A Novel Asynchronous Parallelism Scheme for First-Order Logic , 1994, CADE.

[18]  Gil Utard,et al.  Proving Data-Parallel Programs: a Unifying Approach , 1996, Parallel Process. Lett..

[19]  Salvatore J. Stolfo,et al.  DADO: A Tree-Structured Machine Architecture for Production Systems , 1982, AAAI.

[20]  Johann Schumann,et al.  Parallel Automated Theorem Proving* *This work was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 342, Teilprojekt A5 (Parallelization of Inference Systems). , 1994 .

[21]  Christian B. Suttner.  SPTHEO - A PVM-Based Parallel Theorem Prover , 1996, PVM.

[22]  Peter Graf.  Extended Path-Indexing , 1994, CADE.

[23]  Maria Paola Bonacina,et al.  Parallelization of deduction strategies: An analytical study , 1994, Journal of Automated Reasoning.

[24]  David A. Plaisted,et al.  Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.

[25]  Maria Paola Bonacina,et al.  PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems , 1996, J. Symb. Comput..

[26]  Maria Paola Bonacina,et al.  Experiments with subdivision of search in distributed theorem proving , 1997, PASCO '97.

[27]  Ewing L. Lusk,et al.  Parallelizing the Closure Computation in Automated Deduction , 1990, CADE.

[28]  John E. Laird,et al.  A universal weak method , 1993 .

[29]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[30]  Nancy Martin,et al.  Programming Expert Systems in OPS5 - An Introduction to Rule-Based Programming(1) , 1985, Int. CMG Conference.

[31]  William McCune,et al.  Experiments with ROO: A Parallel Automated Deduction System , 1990, Dagstuhl Seminar on Parallelization in Inference Systems.

[32]  Jean Goubault-Larrecq.  Proving with BDDs and Control of Information , 1994, CADE.

[33]  J. Dekleer.  An assumption-based TMS , 1986 .

[34]  Chih-Hung Wu,et al.  Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures , 1994, Journal of Automated Reasoning.

[35]  Mark E. Stickel.  A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler , 1986, CADE.

[36]  Karsten Konrad.  HOT: A Concurrent Automated Theorem Prover Based on Higher-Order Tableaux , 1998, TPHOLs.

[37]  David A. Plaisted,et al.  Non-Horn clause logic programming without contrapositives , 1988, Journal of Automated Reasoning.

[38]  Maria Paola Bonacina,et al.  On the Reconstruction of Proofs in Distributed Theorem Proving: a Modified Clause-Diffusion Method , 1996, J. Symb. Comput..

[39]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[40]  Johann Schumann.  DELTA - A Bottom-up Preprocessor for Top-Down Theorem Provers - System Abstract , 1994, CADE.

[41]  Mark E. Stickel,et al.  A prolog technology theorem prover: Implementation by an extended prolog compiler , 1986, Journal of Automated Reasoning.

[42]  Maria Paola Bonacina,et al.  Distributed Theorem Proving by Peers , 1994, CADE.

[43]  Yale N. Patt,et al.  Unification Parallelism: How Much Can We Exploit? , 1989, NACLP.

[44]  Roderick Moten.  Exploiting Parallelism in Interactive Theorem Provers , 1998, TPHOLs.