A superposition oriented theorem prover

Authors:
L. Fribourg
Affiliations:
L.I.T.P, Paris Cedex 05, France
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 8
Cited 0

The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)
An Implementation of the Model Elimination Proof Procedure

Journal of the ACM (JACM)
A Human Oriented Logic for Automatic Theorem-Proving

Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Another Generalization of Resolution

Journal of the ACM (JACM)
Comparison of Natural Deduction and Locking Resolution Implementations

Proceedings of the 6th Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
Proofs by induction in equational theories with constructors

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A theorem proving procedure is described which combines the approach of locking resolution with that of rewriting systems. Indeed, both the binary resolution and a complete restriction of paramodulation are embodied by an extension of the rewriting operation called superposition. Experimental results are reported and compared with literature automated proofs.