© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Two Loop Detection Mechanisms: A Comparison
J. M. Howe
In D. Galmiche, editor, TABLEAUX'97, volume 1227 of Lecture Notes in Artificial Intelligence, pages 182-196. Springer-Verlag, May 1997.Abstract
In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both (unknown variable MJ)^{Hist}$, 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 \& Pinto with the work of Heuerding \emph{et 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.
Download publication 32 kbytes
Bibtex Record
@inproceedings{944,
author = {Howe, J. M.},
title = {Two {L}oop {D}etection {M}echanisms: {A} {C}omparison},
month = {May},
year = {1997},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1997/944},
booktitle = {TABLEAUX'97},
editor = {Galmiche, D.},
publication_type = {inproceedings},
publisher = {Springer-Verlag},
series = {Lecture Notes in Artificial Intelligence},
submission_id = {22264_945702101},
volume = {1227},
}