Completely non-clausal theorem proving

摘要

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.