@article{Lee_Plaisted_2012, title={Controlling the Consumption of Storage with Sliding Priority Search in a Hyper-Linking Based Theorem Prover}, volume={14}, url={https://www.cai.sk/ojs/index.php/cai/article/view/291}, abstractNote={The hyper-linking strategy proposed in [17] eliminates duplication of instances of clauses during the process of inference. However, hyper/instances were generated exhaustively by breadth/first search which may cause memory-paging troubles for hard problems since all hyper-instances have to be stored and processed. We present a sliding priority search to provide control on the number of hyper-instances saved and the amount of memory consumed by discarding those instances whose priority value exceeds a priority bound. The bound is set automatically rather than by the user. A technique similar to iterative deepening is also applied to preserve completeness of the hyper-linking strategy. The sliding priority method enabled us to get a number of proofs that could not be obtained with breadth-first search.}, number={6}, journal={COMPUTING AND INFORMATICS}, author={Lee, S. J. and Plaisted, D. A.}, year={2012}, month={Jan.}, pages={563–578} }