A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Theorem Proving via General Matings
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Elimination of Redundant Links in Extended Connection Graphs
GWAI '81 Proceedings of the German Workshop on Artificial Intelligence
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Problems and Experiments for and with Automated Theorem-Proving Programs
IEEE Transactions on Computers
Resolution, Refinements, and Search Strategies: A Comparative Study
IEEE Transactions on Computers
A Search Technique for Clause Interconnectivity Graphs
IEEE Transactions on Computers
Extension of the Top-Down Data-Driven Strategy to ILP
Inductive Logic Programming
| Hi-index | 0.00 |
A subsumption test based on the principal idea of Kowalski'sconnection graph proof procedure is developed. In contrast to the standard test this new test is sufficiently efficient to permit the unrestricted use of the subsumption rule in practice. The test is not limited to the connection graph proof procedure, but most naturally embedded into it. In the latter case the unrestricted combination of subsumption with other deletion rules is shown to be inconsistent.