Abstract
Over the past 25 years, researchers have written numerous deduction systems based on resolution and paramodulation. Of these systems, very few have been capable of generating and maintaining aformula database containing more than just a few thousand clauses. These few systems were used to explore mechanisms for rapidly extracting limited subsets of ‘relevant’ clauses. We have developed a simple, powerful deduction system that reflects some of the best of the ideas that have emerged from the research. This paper describes that deduction system and casts the idea in a form that makes them easily accessible to researchers wishing to write their own high-performance systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Butler, R. and Overbeek, R., A tutorial on the construction of high-performance resolution/paramodulation systems, Technical Report ANL-90/30, Argonne National Laboratory, Mathematics and Computer Science Division, 1990.
Christian, J., High-performance permutative completion, Technical Report ACT-AI-308-89, MCC, Austin, Texas, 1989.
Christian, J., Flatterms, discrimination nets, and fast term rewriting,J. Automated Reasoning 10(1) (1993) 95–114.
Dershowitz, N., Termination of rewriting,J. Symbolic Comput.3 (1987) 69–116.
Gonnet, G. H.,Handbook of Algorithms and Data Structures, Addison-Wesley, New York, 1984.
McCharen, J., Overbeek, R. and Wos, L., Complexity and related enhancements for automated theorem-proving programs,Computers and Mathematics with Applications 2 (1976) 1–16.
McCune, W. W., OTTER 2.0 users' guide, Technical Report ANL-90/9, Argonne National Laboratory, Mathematics and Computer Science Division, 1990.
McCune, W. W., Experiments with discrimination-tree indexing and path indexing for term retrieval,J. Automated Reasoning 9(2) (1992) 147–168.
Overbeek, R., An implementation of hyper-resolution,Comput. Math. Appl. 1 (1975) 201–214.
Author information
Authors and Affiliations
Additional information
This work was partially supported by National Science Foundation grant CCR-8810947 and by the Office of Scientific Computing, U.S. Department of Energy under contract W-31-109-Eng-38.
Rights and permissions
About this article
Cite this article
Butler, R.M., Overbeek, R.A. Formula databases for high-performance resolution/paramodulation systems. J Autom Reasoning 12, 139–156 (1994). https://doi.org/10.1007/BF00881885
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00881885