@INPROCEEDINGS{BachmairGanzinger-98-cade,
        AUTHOR	= {Bachmair, L. and Ganzinger, H.},
        TITLE	= {Strict Basic Superposition},
	BOOKTITLE          = {Automated Deduction --- CADE'15},
        PUBLISHER       = {Springer-Verlag},
        SERIES          = {Lecture Notes in Computer Science},
        ADDRESS         = {Berlin},
        VOLUME             = {1421},
        PAGES           ={175--190},
        YEAR               = {1998},
        URL={\hgURL{~hg/pca.html#98CADE.2}},
        ABSTRACT = {In this paper we solve a long-standing open problem
by showing that strict superposition---that is,
superposition without equality factoring---is refutationally complete.
The difficulty of the problem arises from the fact that the strict calculus,
in contrast to the standard calculus with equality factoring,
is not compatible with arbitrary removal of tautologies,
so that the usual techniques for proving the (refutational) completeness
of paramodulation calculi are not directly applicable.
We deal with the problem by introducing a suitable notion
of {\em direct rewrite proof\/} and
modifying proof techniques based on candidate models
and counterexamples in that we define these concepts,
not in terms of semantic truth, but in terms of direct
provability.
We introduce a corresponding concept of redundancy
with which strict superposition is compatible and that
covers most simplification techniques.},
}