Two Loop Detection Mechanisms: A Comparison

Howe, Jacob M. (1997) Two Loop Detection Mechanisms: A Comparison. In: TABLEAUX'97, May 13-16, 1997, Pont A Mousson, France, . (doi: (Full text available)

Other (zip)
Download (33kB)
Download (98kB)
Download (100kB)
Official URL


In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ<sup>Hist</sup>, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in different ways the ideas on focused proof search of Herbelin and Dyckhoff &amp; Pinto with the work of Heuerding emphet al on loop detection. The Scottish calculus detects loops earlier than the Swiss calculus but at the expense of modest extra storage in the history. A comparison of the two approaches is then given, both on a theoretic and on an implementational level.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 25 Aug 2009 17:28 UTC
Last Modified: 09 Jul 2014 11:59 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year