Solving simplification ordering constraints
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 352-367
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Ordering constraints on trees2005
- Simple LPO constraint solving methodsInformation Processing Letters, 1993
- Polynomial time termination and constraint satisfaction tests1993
- About the theory of tree embeddingLecture Notes in Computer Science, 1993
- A new method for undecidability proofs of first order theoriesJournal of Symbolic Computation, 1992
- Theorem proving with ordering constrained clauses1992
- Satisfiability of systems of ordinal notations with the subterm property is decidableLecture Notes in Computer Science, 1991
- SOLVING SYMBOLIC ORDERING CONSTRAINTSInternational Journal of Foundations of Computer Science, 1990
- Rewrite Systems1990
- Termination of rewritingJournal of Symbolic Computation, 1987