The following pages link to (Q3809306):
Displaying 16 items.
- Equational completion in order-sorted algebras (Q912606) (← links)
- Critical pair criteria for completion (Q1106659) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- The equational part of proofs by structural induction (Q1317862) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Automating Theories in Intuitionistic Logic (Q3655199) (← links)
- The connection between the fundamental groupoid and a unification algorithm for syntactic algebras (Extended abstract) (Q3994022) (← links)
- Learning domain knowledge to improve theorem proving (Q4647500) (← links)
- Confluence of prefix-constrained rewrite systems (Q4993332) (← links)
- Complete sets of reductions modulo associativity, commutativity and identity (Q5055710) (← links)
- Consider only general superpositions in completion procedures (Q5055743) (← links)
- Extension of the associative path ordering to a chain of associative commutative symbols (Q5055809) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- Term rewriting induction (Q6488529) (← links)
- Theorem proving modulo associativity (Q6560183) (← links)
