A note on resolution, connection graphs, and subsumption

  • Authors:
  • Dennis de Champeaux

  • Affiliations:
  • University of Amsterdam, Jodenbreestr, NH Amsterdam

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

Completeness is endangered by the combination in connection graph of subsumption deletion rules and the run time pure literal rule. With some care we can restore completeness.