The following pages link to (Q3336735):
Displaying 9 items.
- Building exact computation sequences (Q579925) (← links)
- A superposition oriented theorem prover (Q1060857) (← links)
- On solving the equality problem in theories defined by Horn clauses (Q1085152) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- Narrowing vs. SLD-resolution (Q1105364) (← links)
- A strong restriction of the inductive completion procedure (Q1824381) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Regular substitution sets: A means of controlling E-unification (Q5055844) (← links)
