Lazy and Eager Patterns in High-Performance Automated Theorem Proving

6 pages•Published: April 11, 2024

Abstract

Eager maintenance of invariants is often the first approach to implement high-performance data structures. We present a number of examples from the evolving implementation of the theorem prover E to demonstrate that a more relaxed, lazy implementation can have advantages for simplicity, performance, or both. Existing examples include shared rewriting, term cell garbage collection, and orphan removal, additional optimisations are identified for term index maintenance and clause selection.

Keyphrases: automated theorem proving, efficient algorithms, implementation of logics

In: Laura Kovács and Michael Rawson (editors). Proceedings of the 7th and 8th Vampire Workshop, vol 99, pages 7-12.

Links:	https://easychair.org/publications/paper/jkCj
	https://doi.org/10.29007/9hw9

BibTeX entry

@inproceedings{Vampire23:Lazy_Eager_Patterns_High,
  author    = {Stephan Schulz},
  title     = {Lazy and Eager Patterns in High-Performance Automated Theorem Proving},
  booktitle = {Proceedings of the 7th and 8th Vampire Workshop},
  editor    = {Laura Kovács and Michael Rawson},
  series    = {EPiC Series in Computing},
  volume    = {99},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/jkCj},
  doi       = {10.29007/9hw9},
  pages     = {7-12},
  year      = {2024}}

Download PDF Open PDF in browser