A new ordering constraint solving method and its applications

Nieuwenhuis, Robert

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

A new ordering constraint solving method and its applications

MPS-Authors

/persons/resource/persons45125

Nieuwenhuis, Robert
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-92-238.pdf
(Any fulltext), 15MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Nieuwenhuis, R.(1992). A new ordering constraint solving method and its applications (MPI-I-92-238). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B732-B

Abstract

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.