The following pages link to Combining unification algorithms (Q1329186):
Displaying 26 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- A practical unification algorithm (Q751312) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- A practically efficient and almost linear unification algorithm (Q1105360) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- Completion for unification (Q1178701) (← links)
- Combining matching algorithms: The regular case (Q1186723) (← links)
- Unification with extended patterns (Q1274966) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Combining decision algorithms for matching in the union of disjoint equational theories (Q1917102) (← links)
- (Q2778871) (← links)
- Unification and Matching in Hierarchical Combinations of Syntactic Theories (Q2964469) (← links)
- (Q3046707) (← links)
- (Q3722253) (← links)
- (Q3726081) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Combining matching algorithms: The regular case (Q5055731) (← links)
- Combination techniques and decision problems for disunification (Q5055803) (← links)
- Combination of constraint solving techniques: An algebraic point of view (Q5055842) (← links)
- AC-complete unification and its application to theorem proving (Q5055849) (← links)
- Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
