โ Scribed by Neil V. Murray
No coin nor oath required. For personal study only.
The proof procedure we describe operates on quantifier-free formulas of the predicate calculus which are not truth-functionally normalized in any way. The procedure involves a single inference rule called NC-resolution, and is shown to be complete. Completeness is also obtained for a simple restriction on the rule's application.
Examples are given using NC-resolution to derive a logic program from its specification, and to 'execute' a program specification in its original form.
๐ SIMILAR VOLUMES
In this paper we present a theoretical basis justifying the incorporation of decidability results for a first-order theory \(T\) into an automated theorem prover for \(T\). We state rules which extend resolution using decidability results relative to \(T\) in both the ground and the non-ground case,
## SOME RECENT DEVELOPMENTS IN COMPLETE STRATEGIES FOR THEOREM-PROVING BY COMPUTER1) by BERNARD MELTZER in Edinburgh, Scotland