Pages that link to "Item:Q582270"

The following pages link to Unification in a combination of arbitrary disjoint equational theories (Q582270):

Displaying 36 items.

• On the complexity of Boolean unification (Q293360) (← links)
• Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
• \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
• Efficient general AGH-unification (Q462489) (← links)
• Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
• Combination techniques and decision problems for disunification (Q673624) (← links)
• A combinatory logic approach to higher-order E-unification (Q673971) (← links)
• Non-disjoint combined unification and closure by equational paramodulation (Q831919) (← links)
• Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
• The unification hierarchy is undecidable (Q1181721) (← links)
• Combining matching algorithms: The regular case (Q1186723) (← links)
• Unification problem in equational theories (Q1280985) (← links)
• Deciding the word problem in the union of equational theories. (Q1400706) (← links)
• Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
• Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
• Combination problems for commutative/monoidal theories or how algebra can help in equational unification (Q1919702) (← links)
• Modularity in term rewriting revisited (Q1929227) (← links)
• Terminating non-disjoint combined unification (Q2119106) (← links)
• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
• A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
• Hierarchical combination of intruder theories (Q2482450) (← links)
• Unification and Matching in Hierarchical Combinations of Syntactic Theories (Q2964469) (← links)
• Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
• Using types as search keys in function libraries (Q4939694) (← links)
• (Q4989394) (← links)
• AC unification through order-sorted AC1 unification (Q5055752) (← links)
• Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification (Q5055754) (← links)
• Modular higher-order E-unification (Q5055760) (← 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)
• An algorithm for distributive unification (Q5055867) (← links)
• A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method (Q5234683) (← links)
• Second-order unification in the presence of linear shallow algebraic equations (Q5881305) (← links)
• A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
• On interreduction of semi-complete term rewriting systems (Q5941203) (← links)