Z-Resolution: Theorem-Proving with Compiled Axioms

@article{Dixon1973ZResolutionTW,
  title={Z-Resolution: Theorem-Proving with Compiled Axioms},
  author={John K. Dixon},
  journal={J. ACM},
  year={1973},
  volume={20},
  pages={127-147}
}
An improved procedure for resolution theorem proving, called Z-resolution, is described. The basic idea of Z-resolution is to “compile” some of the axioms in a deductive problem. This means to automatically transform the selected axioms into a computer program which carries out the inference rules indicated by the axioms. This is done automatically by another program called the specializer. The advantage of doing this is that the compiled axioms run faster, just as a compiled program runs… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS