Journal of Automated Reasoning

, Volume 12, Issue 2, pp 139–156 | Cite as

Formula databases for high-performance resolution/paramodulation systems

  • Ralph M. Butler
  • Ross A. Overbeek


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.

Key words

Resolution/paramodulation systems formula database deduction system 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    Christian, J., High-performance permutative completion, Technical Report ACT-AI-308-89, MCC, Austin, Texas, 1989.Google Scholar
  3. 3.
    Christian, J., Flatterms, discrimination nets, and fast term rewriting,J. Automated Reasoning 10(1) (1993) 95–114.Google Scholar
  4. 4.
    Dershowitz, N., Termination of rewriting,J. Symbolic Comput.3 (1987) 69–116.Google Scholar
  5. 5.
    Gonnet, G. H.,Handbook of Algorithms and Data Structures, Addison-Wesley, New York, 1984.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    McCune, W. W., OTTER 2.0 users' guide, Technical Report ANL-90/9, Argonne National Laboratory, Mathematics and Computer Science Division, 1990.Google Scholar
  8. 8.
    McCune, W. W., Experiments with discrimination-tree indexing and path indexing for term retrieval,J. Automated Reasoning 9(2) (1992) 147–168.Google Scholar
  9. 9.
    Overbeek, R., An implementation of hyper-resolution,Comput. Math. Appl. 1 (1975) 201–214.Google Scholar

Copyright information

© Kluwer Academic Publishers 1994

Authors and Affiliations

  • Ralph M. Butler
    • 1
  • Ross A. Overbeek
    • 2
  1. 1.College of Computing Sciences and EngineeringUniversity of North FloridaUSA
  2. 2.Mathematics and Computer Science DivisionArgonne National LaboratoryArgonneUSA

Personalised recommendations