RRTP - A Replacement Rule Theorem Prover

Authors:
M. Paramasivam;David A. Plaisted
Affiliations:
Department of Computer Science, University of North Carolina, Chapel Hill, North Carolina, USA. e-mail: {parama,plaisted}@cs.unc.edu;Department of Computer Science, University of North Carolina, Chapel Hill, North Carolina, USA. e-mail: {parama,plaisted}@cs.unc.edu
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 4
Cited 4

Term rewriting: Some experimental results

Journal of Symbolic Computation
Use of replace rules in theorem proving

Methods of Logic in Computer Science
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction

Automated Deduction Techniques for Classification in Description Logic Systems

Journal of Automated Reasoning
Replacement Rules with Definition Detection

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
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
An extension rule based first-order theorem prover

KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management

Quantified Score

Hi-index	0.00

Visualization

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.