The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.07 |
An algorithm for the construction of finite models of sets of predicate-calculus sentences is given. The algorithm differs from resolution in its ability to incorporate certain extra sentences (human advice) gracefully. Since the problem attacked by the algorithm is NP-complete, it is hoped that this ability to accept advice will make the algorithm useful more as a tool in the hands of a researcher than as a stand-alone procedure.