SOLVING SYMBOLIC ORDERING CONSTRAINTS
From MaRDI portal
Recommendations
Cited in
(19)- A new method for undecidability proofs of first order theories
- The first-order theory of lexicographic path orderings is undecidable
- Unification of infinite sets of terms schematized by primal grammars
- Practical algorithms for deciding path ordering constraint satisfaction.
- Orienting rewrite rules with the Knuth-Bendix order.
- Stratified resolution
- Pumping, cleaning and symbolic constraints solving
- Delaying Constraint Solving in Symbolic Graph Transformation
- scientific article; zbMATH DE number 1405617 (Why is no real title available?)
- scientific article; zbMATH DE number 1456949 (Why is no real title available?)
- About the theory of tree embedding
- Encompassment properties and automata with constraints
- A precedence-based total AC-compatible ordering
- Solving simplification ordering constraints
- Redundancy criteria for constrained completion
- A total AC-compatible ordering based on RPO
- Simple LPO constraint solving methods
- Partial redundancy in saturation
- Reducibility constraints in superposition
This page was built for publication: SOLVING SYMBOLIC ORDERING CONSTRAINTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753928)