The following pages link to (Q3838762):
Displaying 9 items.
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- SPASS-AR: a first-order theorem prover based on approximation-refinement into the monadic shallow linear fragment (Q2303255) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Modular proof systems for partial functions with Evans equality (Q2432764) (← links)
- Superposition for Fixed Domains (Q3540186) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← links)