Layered Clause Selection for Theory Reasoning
Authors:
Preprint
Abstract
Explicit theory axioms are added by a saturation-based theorem prover as one of the techniques for supporting theory reasoning. While simple and effective, adding theory axioms can also pollute the search space with many irrelevant consequences. As a result, the prover often gets lost in parts of the search space where the chance to find a proof is low. In this paper we describe a new strategy for controlling the amount of reasoning with explicit theory axioms. The strategy refines a recently proposed two-layer-queue clause selection and combines it with a heuristical measure of the amount of theory reasoning in the derivation of a clause. We implemented the new strategy in the automatic theorem prover Vampire and present an evaluation showing that our work dramatically improves the state-of-the-art clause-selection strategy in the presence of theory axioms.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Verifying Relational Properties using Trace Logic2019
- GKC: A Reasoning System for Large Knowledge Bases2019
- ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E2019
- Old or Heavy? Decaying Gracefully with Age/Weight Shapes2019
- Hierarchic Superposition with Weak AbstractionLecture Notes in Computer Science, 2013
- Limited resource strategy in resolution theorem provingJournal of Symbolic Computation, 2003
- Ordered chaining calculi for first-order theories of transitive relationsJournal of the ACM, 1998
- OTTER 3.0 reference manual and guide1994
- A New Class of Automated Theorem-Proving AlgorithmsJournal of the ACM, 1974
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965