max planck institut
informatik

# MPI-I-92-238

## A new ordering constraint solving method and its applications

### Nieuwenhuis, Robert

MPI-I-92-238. February 1992, 12 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We show that it is possible to transform any given
LPO ordering constraint $C$ into a finite equivalent set of constraints
$S$ for which a special kind of solutions can be obtained.
This allows to compute the equalities that follow from ordering
constraints,
and to decide e.g.\ whether an {\em ordering constrained equation\/}
is a tautology.
Another application we develop here
is a method to check ordered rewrite systems
for (ground) confluence.
Acknowledgement:
References to related material:

MPI-I-92-238.pdf14647 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-238
BibTeX
@TECHREPORT{Nieuwenhuis92a,
AUTHOR = {Nieuwenhuis, Robert},
TITLE = {A new ordering constraint solving method and its applications},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},