Equality-based binary resolution

  • Authors:
  • Vincent J. Digricoli;Malcolm C. Harrison

  • Affiliations:
  • Fordham Univ., Bronx, NY;New York Univ., New York

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

A major event in automated reasoning was the introduction by Robinson of resolution as an inference principle that is complete for the first-order predicate calculus. Here the theory of binary resolution, based strictly on unification, is recast to incorporate the axioms of equality. Equality-based binary resolution is complete without making use of paramodulation and leads to refutations that are less than half as long as standard refutations with the equality axioms. A detailed discussion is given of the first major use of a theorem prover based on this new method.