Journal of Automated Reasoning

, Volume 11, Issue 1, pp 83–113

Bounded-overhead caching for definite-clause theorem proving

  • Alberto Segre
  • Daniel Scharstein

DOI: 10.1007/BF00881901

Cite this article as:
Segre, A. & Scharstein, D. J Autom Reasoning (1993) 11: 83. doi:10.1007/BF00881901


In this paper we describe the design of an effective caching mechanism for resource-limited, definite-clause theorem-proving systems. Previous work in adapting caches for theorem proving relies on the use of unlimited-size caches. We show how unlimited-size caches are unsuitable in application contexts where resource-limited theorem provers are used to solve multiple problems from a single problem distribution. We introduce bounded-overhead caches, that is, those caches that contain at most a fixed number of entries and entail a fixed amount of overhead per lookup, and we examine cache design issues for bounded-overhead caches. Finally, we present an empirical evaluation of bounded-overhead cache performance, relying on a specially designed experimental methodology that separates hardware-dependent, implementation-dependent, and domain-dependent effects.

Key words

Machine learning caching memoization 

Copyright information

© Kluwer Academic Publishers 1993

Authors and Affiliations

  • Alberto Segre
    • 1
  • Daniel Scharstein
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations