Skip navigation
Skip navigation

A history-based theorem prover for intuitionistic propositional logic using global caching: InthistGC system description

Gore, Rajeev; Thomson, James; Wu, Jesse


We describe an implementation of a new theorem prover for Intuitionistic Propositional Logic based on a sequent calculus with histories due to Corsi and Tassi. The main novelty of the prover lies in its use of dependency directed backtracking for global caching. We analyse the performance of the prover, and various optimisations, in comparison to current state of the art theorem provers and show that it produces competitive results on many classes of formulae.

CollectionsANU Research Publications
Date published: 2014
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-319-08587-6_19


File Description SizeFormat Image
01_Gore_A_history-based_theorem_prover_2014.pdf161.34 kBAdobe PDF    Request a copy
02_Gore_A_history-based_theorem_prover_2014.pdf878.59 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator