Pages that link to "Item:Q685481"
From MaRDI portal
The following pages link to Simple LPO constraint solving methods (Q685481):
Displaying 10 items.
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710) (← links)
- Orienting rewrite rules with the Knuth-Bendix order. (Q1401932) (← links)
- Stratified resolution (Q1404977) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Ordered tableaux: Extensions and applications (Q4610325) (← links)
- More problems in rewriting (Q5055812) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
- Ordered chaining for total orderings (Q5210789) (← links)
- What you always wanted to know about rigid E-unification (Q5235253) (← links)