Layered Clause Selection for Theory Reasoning
Authors:
- 24 June 2020
- book chapter
- Published by Springer Nature
- Vol. 12166, 402-409
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 heuristic 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 22 references indexed in Scilit:
- Verifying Relational Properties using Trace Logic2019
- ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E2019
- Reachability Analysis for AWS-Based Networks2019
- Automated Deduction – CADE 272019
- The vampire and the FOOL2016
- Extensional Crisis and Proving IdentityLecture Notes in Computer Science, 2014
- Hierarchic Superposition with Weak AbstractionLecture Notes in Computer Science, 2013
- Superposition Modulo Linear Arithmetic SUP(LA)2009
- Resolution Theorem Proving2001
- Ordered chaining calculi for first-order theories of transitive relationsJournal of the ACM, 1998