Requirement-Based Cooperative Theorem Proving

We examine an approach for demand-driven cooperative theorem proving that is well-suited for saturation-based theorem provers. We briefly point out some problems arising from the use of common success-driven cooperation methods, and we propose the application of our approach of requirement-based cooperative theorem proving. This approach aims to allowing more orientation on current needs of provers in comparison with conventional cooperation concepts. We introduce an abstract framework for requirement-based cooperation and describe two instantiations of it: Requirement-based exchange of facts and subproblem division and transfer via requests. Finally, we report on an experimental study conducted in the areas of superposition and unfailing completion.

[1]  Christoph Weidenbach.  Extending the Resolution Method with Sorts , 1993, IJCAI.

[2]  Maria Paola Bonacina,et al.  The Clause-Diffusion Methodology for Distributed Deduction , 1995, Fundam. Informaticae.

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

[4]  Jörg Denzinger,et al.  Knowledge-based Cooperation between Theorem Provers by Techs , 1999 .

[5]  Jörg Denzinger.  Knowledge-Based Distributed Search Using Teamwork , 1995, ICMAS.

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

[7]  Matthias Fuchs,et al.  Goal Oriented Equational Theorem Proving Using Team Work , 1994, KI.

[8]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, CADE.

[9]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[10]  Wolfgang Ertel,et al.  OR-Parallel Theorem Proving with Random Competition , 1992, LPAR.

[11]  Jörg Denzinger,et al.  Cooperation in Theorem Proving by Loosely Coupled Heuristics , 1999 .

[12]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[13]  Matthias Fuchs,et al.  DISCOUNT: A SYstem for Distributed Equational Deduction , 1995, RTA.

[14]  Nachum Dershowitz,et al.  A Maximal-Literal Unit Strategy for Horn Clauses , 1990, CTRS.

[15]  Jörg Denzinger,et al.  Enhancing conventional search systems with multi-agent techniques: a case study , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[16]  Klaus U. Schulz,et al.  Frontiers of Combining Systems , 1996 .

[17]  Geoff Sutcliffe,et al.  A Heterogeneous Parallel Deduction System Page 1 A Heterogeneous Parallel Deduction System , 1992 .

[18]  Christoph Weidenbach,et al.  SPASS & FLOTTER Version 0.42 , 1996, CADE.

[19]  Dirk Fuchs,et al.  Coupling Saturation-Based Provers by Exchanging Positive/Negative Information , 1998, RTA.

[20]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[21]  L. Bachmair,et al.  Completion without Failure 1 , 1989 .

[22]  Matthias Fuchs,et al.  Evolving Combinators , 1997, CADE.

[23]  Michaël Rusinowitch,et al.  On Word Problems in Equational Theories , 1987, ICALP.