Completeness results for inequality provers
Artificial Intelligence
Set theory in first-order logic: clauses for Go¨del's axioms
Journal of Automated Reasoning
Automated reasoning: 33 BASIC research problems
Automated reasoning: 33 BASIC research problems
Information Processing Letters
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Recognizing unnecessary inference
Recognizing unnecessary inference
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Automated Reasoning: Introduction and Applications
Automated Reasoning: Introduction and Applications
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
| Hi-index | 0.00 |
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to prevent paramodulation into subterms of Skolem expressions. A weak completeness result is presented (the functional reflexive axioms are assumed). Experimental results on problems in set theory, combinatory logic, Tarski geometry, and algebra show that the strategy can be useful when searching for refutations and when applying Knuth-Bendix completion. The emphasis of the paper is on the effectiveness of the strategy rather than on its completeness.