Waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper)

10 pages•Published: May 26, 2024

Abstract

Most high-end automated theorem provers for first order logic (FOL) split available time between short runs of a large portfolio of search strategies. These runs are typically independent and can be parallelized to exploit all the available processor cores. We explore several avenues of re-using clauses generated by earlier runs and present experimental results of their usefulness or lack thereof.

Keyphrases: automated theorem proving, portfolio of strategies, reuse, saturation based proving

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 100, pages 106-115.

Links:	https://easychair.org/publications/paper/wbJ2
	https://doi.org/10.29007/fs4b

BibTeX entry

@inproceedings{LPAR2024:Waste_Reduction_Experiments_Sharing,
  author    = {Tanel Tammet},
  title     = {Waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper)},
  booktitle = {Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {100},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/wbJ2},
  doi       = {10.29007/fs4b},
  pages     = {106-115},
  year      = {2024}}

Download PDF Open PDF in browser