Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Finding resolution proofs and using duplicate goals in and/or trees
Information Sciences: an International Journal
Introduction Tutorial on Resolution
IEEE Transactions on Computers
Semantic paramodulation for Horn sets
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Fundamental study: The multiple facets of the canonical direct unit implicational basis
Theoretical Computer Science
| Hi-index | 15.00 |
A new resolution strategy for Horn sets of clauses, each clause of which contains no more-than one positive literal, is presented which requires that in each resolution either one ancestor be a false positive unit or that one ancestor and the resolvent both be false. This strategy emphasizes "relevant" positive units while controlling the explosive nonunit resolution. Some properties of interpretations for Horn sets are reviewed and used to significantly reduce the computation and storage required to implement semantic resolution for Horn sets.