Term Indexing
Journal of Automated Reasoning
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
WALDMEISTER - High-Performance Equational Deduction
Journal of Automated Reasoning
The CADE-16 ATP System Competition
Journal of Automated Reasoning
Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
DISCOUNT: A SYstem for Distributed Equational Deduction
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
On the Evaluation of Indexing Techniques for Theorem Proving
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Vampire 1.1 (System Description)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
NORA/HAMMR: making deduction-based software component retrieval practical
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
Automated reasoning: past story and new trends
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
SOLAR: An automated deduction system for consequence finding
AI Communications - Practical Aspects of Automated Reasoning
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Reasoning support for expressive ontology languages using a theorem prover
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
The 481 ways to split a clause and deal with propositional variables
CADE'13 Proceedings of the 24th international conference on Automated Deduction
First-Order theorem proving and vampire
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
For most applications of first-order theorem provers a proof should be found within a fixed time limit. When the time limit is set, systems can perform much better by using algorithms other than the ordinary complete ones. In this paper we describe the limited resource strategy (LRS) intended to improve performance of the OTTER saturation algorithm when a fixed limit is imposed on the time of a run. The strategy is adaptive in the following sense: it adjusts the limit on the weight of clauses according to some statistics collected on the earlier stages of proof search. We give experimental evidence that the LRS gives a considerable improvement over the OTTER saturation algorithm. We also show that it is superior to the DISCOUNT algorithm, which does not use passive clauses for simplification, and to the non-adaptive weight-based algorithms.