Solving Simplification Ordering Constraints


This paper considers the decision problem for the existential fragment of the theory of simplification orderings. A simple, polynomial-time procedure for deciding satisfiability of such constraints is given, and it is also shown that the corresponding problem for the theory of total simplification orderings is NP-complete. This latter result can be… (More)
DOI: 10.1007/BFb0016865

1 Figure or Table


  • Presentations referencing similar topics