Goal Oriented Equational Theorem Proving Using Team Work

The team work method is a concept for distributing automated theorem provers by activating several experts to work on a problem. We have implemented this for pure equational logic using the unfailing Knuth-Bendix completion procedure as basic prover. In this paper we present three classes of experts working in a goal oriented fashion. In general, goal oriented experts perform their job “unfair” and so are often unable to solve a given problem alone. However, as team members in the team work method they perform highly efficiently, as we demonstrate by examples, some of which can only be proved using team work.

[1]  Rolf Socher-Ambrosius,et al.  A Goal Oriented Strategy Based on Completion , 1992, ALP.

[2]  Maria Paola Bonacina,et al.  On Fairness of Completion-Based Theorem Proving Strategies , 1991, RTA.

[3]  Nachum Dershowitz,et al.  Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .

[4]  Nirina Andrianarivelo,et al.  Heuristical Criteria in Refutational Theorem Proving , 1990, DISCO.

[5]  D. Louvish,et al.  Fully Ordered Groups , 1974 .

[6]  Jörg Denzinger,et al.  Distributing Equational Theorem Proving , 1993, RTA.

[7]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[8]  Karl-Hans Bläsius.  Equality reasoning based on graphs , 1986 .

[9]  Larry Wos,et al.  Benchmark Problems in Which Equality Plays the Major Role , 1992, CADE.

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

[11]  Jörg Denzinger,et al.  Analysis and Representation of Equational Proofs Generated by a Distributed Completion Based Proof System , 1994 .

[12]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[13]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[14]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).