We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem proving. We outline an approach to measuring the complexity of search which can be applied to analyze and evaluate the behaviour of theorem-proving strategies. Using our framework, we compare contraction-based strategies of different contraction power and show how they affect the evolution of the respective search spaces during the derivation.
|Titolo:||On the modelling of search in theorem proving - Towards a theory of strategy analysis|
|Data di pubblicazione:||1998|
|Appare nelle tipologie:||01.01 Articolo in Rivista|