The following pages link to (Q3696496):
Displayed 10 items.
- A completion procedure for conditional equations (Q758211) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Order-sorted completion: The many-sorted way (Q1177935) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications (Q1323311) (← links)
- Incorporating decision procedures in implicit induction. (Q1404422) (← links)
- Constraint contextual rewriting. (Q1404984) (← links)
- Automatic proofs by induction in theories without constructors (Q1824382) (← links)