Theorem proving with variable-constrained resolution

  • Authors:

  • C. L. Chang

  • Affiliations:

  • -

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 1972

Quantified Score

Hi-index 0.07

Visualization

Abstract

A set S of clauses is said to be substitutably unsatisfiable if and only if there exist a set M of variants (copies) of clauses in S and a substitution @q such that M@q is truth-functionally unsatisfiable. In this paper, we have introduced ''variable-constrained resolution,'' or V-resolution for short. Using V-resolution, it is guaranteed that the empty clause @? can always be derived from a substitutably unsatisfiable set of clauses. Comparisons between (ordinary) resolution and V-resolution are given. V-resolution has been implemented in a LISP program. Experimental results show that V-resolution is much more efficient than resolution.