JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic

“…The time limit for all proof attempts was 300 s. The results of ileanCoP are listed in the last column of Table 4. We have also included the results of the following five theorem provers for intuitionistic first-order logic: JProver [25] (implemented in ML using a non-clausal connection calculus and prefixes), the Prolog and C versions of ft [24] (using an intuitionistic tableau calculus with many additional optimisation techniques and a contraction-free calculus [6] for propositional formulae), ileanSeP (using an intuitionistic tableau calculus; see http://www.leancop.de/ileansep) and ileanTAP…”

“…The development of proof calculi and implementations based on this characterisation (e.g. [11,21,22,25]) were restricted to non-clausal procedures, making it difficult to use more established clausal methods (e.g. [3,4,13,14]).…”

A Matrix Characterization for Multiplicative Exponential Linear Logic

“…Prefixes represent context management in these logics in a very compact way, which makes them appealing for automating proof search. Efficient string unification algorithms for prefixes exist (Otten and Kreitz, 1996), proof search procedures based on Wallen's representations have been developed (Kreitz and Otten, 1999), and experiments with implementations of these procedures have demonstrated the advantages of the approach (Schmitt et al, 2001).…”

Active Models in Support of Collaborative Design

“…Two such instances of its applications include the Nuprl logical programming environment [15] and Jprover [16], an intuitionistic theorem prover that has been integrated with the Nuprl and MetaPRL [2] proof assistants. In both of these examples, the MathBus term structure is used as a means for communicating terms across different systems with inherently different term syntax.…”