@INPROCEEDINGS{BachmairGanzinger-94-cade,   
        AUTHOR = {Bachmair, L. and Ganzinger, H.},
        TITLE  = {Ordered Chaining for Total Orderings},
	BOOKTITLE = {Proc.~ 12$th$ International Conference on Automated Deduction},
        YEAR = {1994},
	PAGES = {435--450},
	PUBLISHER = {Springer-Verlag},
	SERIES = {Lecture Notes in Computer Science},
	VOLUME	= 814,
	ADDRESS = {Berlin},
        NOTE = {Short version of TR MPI-I-93-250},
	ABSTRACT           = {We propose inference systems based on ordered chaining
and a concept of (global) redundancy for clauses and inferences
for dealing with total orderings.
A key to the practicality of chaining techniques is
the extent to which so-called variable chainings can be restricted.
We demonstrate that ordering restrictions
and the rewrite techniques which account for their completeness
considerably restrict
variable chaining.
For dense total orderings we show that the techniques for eliminating
unshielded variables are admissible simplifications so that no variable
chaining is needed at all.
We also include equality by combining ordered chaining
with superposition.}
}