The following pages link to (Q4036585):
Displaying 18 items.
- The use of embeddings to provide a clean separation of term and annotation for higher order rippling (Q540694) (← links)
- Redundancy criteria for constrained completion (Q673620) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Simple LPO constraint solving methods (Q685481) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Abstract data type systems (Q1391729) (← links)
- 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)
- Ordinals. I: Basic notions (Q1817060) (← links)
- About the theory of tree embedding (Q5044749) (← links)
- Open problems in rewriting (Q5055780) (← links)
- A precedence-based total AC-compatible ordering (Q5055808) (← links)
- Polynomial time termination and constraint satisfaction tests (Q5055810) (← links)
- More problems in rewriting (Q5055812) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
