The following pages link to (Q4264721):
Displaying 10 items.
- Redundancy criteria for constrained completion (Q673620) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Simple LPO constraint solving methods (Q685481) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- Local simplification (Q5096297) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
