New Implementation Framework for Saturation-Based Reasoning
Alexandre Riazanov

TL;DR
This paper proposes new architectural principles for saturation-based reasoning systems, aiming to overcome current limitations in inference selection and search prioritization to potentially achieve significant performance improvements.
Contribution
It introduces a flexible inference selection mechanism and a method for intelligent search direction prioritization to enhance saturation-based theorem provers.
Findings
Proposed a high-precision inference selection mechanism.
Outlined a method for probing and prioritizing search directions.
Discussed implementation strategies for the new architectural principles.
Abstract
The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems, which I attribute to the use of advanced calculi and the intensified research in implementation techniques. However, nowadays we are witnessing a slowdown in performance progress, which may be considered as a sign that the saturation-based technology is reaching its inherent limits. The position I am trying to put forward in this paper is that such scepticism is premature and a sharp improvement in performance may potentially be reached by adopting new architectural principles for saturation. The top-level algorithms and corresponding designs used in the state-of-the-art saturation-based theorem provers have (at least) two inherent drawbacks: the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Logic, Reasoning, and Knowledge
