Abstract
The Replacement Rule Theorem Prover (RRTP) is an instance-based, refutational, first-order clausal theorem prover. The prover is motivated by the idea of selectively replacing predicates by their definitions, and operates by selecting relevant instances of the input clauses. The relevant instances are grounded, if necessary, and tested for unsatisfiability by using a fast propositional calculus decision procedure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang, Ch-L. and Lee, R. Ch-T.: Symbolic and Mechanical Theorem Proving, Academic Press, New York, 1973.
Lee, S.-J. and Plaisted, D. A.: Use of replace rules in theorem proving, Methods of Logic in Computer Science 1 (1994), 217–240.
Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog, in E. Lusk and R. Overbeek (eds), Proc. of CADE-9, Argonne, IL, 1988, pp. 415–434.
Plaisted, D. A. and Potter, R. C.: Term rewriting: Some experimental results, J. Symbolic Computation 11 (1991), 149–180.
Zhang, H. and Stickel, M. E.: Implementing the Davis-Putnam Algorithm by Tries, Technical Report, Department of Computer Science, University of Iowa, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Paramasivam, M., Plaisted, D.A. RRTP - A Replacement Rule Theorem Prover. Journal of Automated Reasoning 18, 221–226 (1997). https://doi.org/10.1023/A:1005847700447
Issue Date:
DOI: https://doi.org/10.1023/A:1005847700447