The following pages link to (Q3789100):
Displaying 7 items.
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Conditional rewriting in focus (Q5881263) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
- On restrictions of ordered paramodulation with simplification (Q6488549) (← links)
- Dissolver: A dissolution-based theorem prover (Q6488581) (← links)
