Pages that link to "Item:Q688565"
From MaRDI portal
The following pages link to Complexity of unification problems with associative-commutative operators (Q688565):
Displaying 23 items.
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. I (Q1864898) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ (Q2835862) (← links)
- Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification (Q2974785) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- On the unification problem for Cartesian closed categories (Q4358059) (← links)
- Unification and matching modulo nilpotence (Q4647522) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Formalising nominal C-unification generalised with protected variables (Q5022930) (← links)
- Combination techniques and decision problems for disunification (Q5055803) (← links)
- More problems in rewriting (Q5055812) (← links)
- An algorithm for distributive unification (Q5055867) (← links)
- Extensions of unification modulo ACUI (Q5139274) (← links)
- AC-superposition with constraints: No AC-unifiers needed (Q5210796) (← links)
- The complexity of counting problems in equational matching (Q5210797) (← links)