The He Refutation Method

  • Stan Raatz
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 10)


In order to generalize the results of the previous section to the first-order case, we will need the notion of unification modulo a set of equations, or E-unification. The concept of E-unification comes up naturally when we apply the Skolem-Herbrand-Gödel theorem to a set of universal Horn clauses with equality, in order to reduce unsatisfiability in the first-order case to unsatisfiability in the ground case. Recall that this theorem states that a set of universal prenex sentences is unsatisfiable if and only if some set of ground substitution instances of the matrices of these sentences is unsatisfiable.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1990

Authors and Affiliations

  • Stan Raatz
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA

Personalised recommendations