The following pages link to (Q4264733):
Displaying 20 items.
- \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- Unification modulo ACUI plus distributivity axioms (Q1774555) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification (Q1919702) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- Unification and matching modulo nilpotence (Q4647522) (← links)
- Combination techniques and decision problems for disunification (Q5055803) (← links)
- More problems in rewriting (Q5055812) (← links)
- Combination of constraint solving techniques: An algebraic point of view (Q5055842) (← links)
- Problems in rewriting III (Q5055847) (← links)
- AC-complete unification and its application to theorem proving (Q5055849) (← links)
- An algorithm for distributive unification (Q5055867) (← links)
- Efficient General Unification for XOR with Homomorphism (Q5200040) (← links)
- Combination techniques for non-disjoint equational theories (Q5210778) (← links)
- On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
- A new approach to general E-unification based on conditional rewriting systems (Q5881211) (← links)
