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
System Description: Spass Version 1.0.0
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
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)
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 intended to improve performance of resolution- and paramodulation-based provers when a fixed limit is imposed on the time of a run. We give experimental evidence that the Limited Resource Strategy gives a significant improvement over the OTTER saturation algorithm, algorithms not using passive clauses for simplification and the weight-based algorithms.