Affiliation:
1. Carnegie-Mellon University, Mathematics Department, Pittsburgh, Pennsylvania
Abstract
A refinement of the resolution method for mechanical theorem proving is presented. A resolvent
C
of clauses
A
and
B
is called a
merge
if literals from
A
and
B
merge together to form some literal of
C
. It is shown that the resolution method remains complete if it is required that two noninitial clauses which are not merges never be resolved with one another. It is also shown that this strategy can be combined with the set-of-support strategy.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献