Pages that link to "Item:Q582270"
From MaRDI portal
The following pages link to Unification in a combination of arbitrary disjoint equational theories (Q582270):
Displayed 16 items.
- 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)
- 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)
- 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)
- Using types as search keys in function libraries (Q4939694) (← links)
- A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
- On interreduction of semi-complete term rewriting systems (Q5941203) (← links)