A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
The automation of syllogistic. II. optimization and complexity issues
Journal of Automated Reasoning
Term rewriting: Some experimental results
Journal of Symbolic Computation
Automated deduction in von Neumann-Bernays-Go¨del set theory
Journal of Automated Reasoning
Journal of Automated Reasoning
Set theory for verification. I: from foundations to functions
Journal of Automated Reasoning
Use of replace rules in theorem proving
Methods of Logic in Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Automated Deduction Techniques for Classification in Description Logic Systems
Journal of Automated Reasoning
RRTP - A Replacement Rule Theorem Prover
Journal of Automated Reasoning
Proceedings of the 10th International Conference on Automated Deduction
Semantically Guided First-Order Theorem Proving using Hyper-Linking
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Selectively Instantiating Definitions
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Instance-based first-order methods using propositional calculus provers
Instance-based first-order methods using propositional calculus provers
Ordered semantic hyper linking
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Model-Based Completeness Proof of Extended Narrowing and Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 0.00 |
The way in which a theorem prover handles definitions can have a significant effect on its performance. Many first-order clause form theorem provers perform badly on theorems such as those from set theory that are proven largely by expanding definitions. The technique of using replacement rules permits automatic proofs of such theorems to be found quickly in many cases. We present a refinement of the replacement rule method which increases its effectiveness. This refinement consists in recognizing which clauses are obtained from first-order definitions.