Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


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
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.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-238.pdfMPI-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:
Hide details for BibTeXBibTeX
  AUTHOR = {Nieuwenhuis, Robert},
  TITLE = {A new ordering constraint solving method and its applications},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-238},
  MONTH = {February},
  YEAR = {1992},
  ISSN = {0946-011X},