Pages that link to "Item:Q1099648"
From MaRDI portal
The following pages link to Associative-commutative unification (Q1099648):
Displaying 28 items.
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Permutative rewriting and unification (Q876048) (← links)
- Unification in abelian semigroups (Q1098653) (← links)
- An algebraic approach to unification under associativity and commutativity (Q1099654) (← links)
- Efficient solution of linear diophantine equations (Q1121310) (← links)
- AC-unification race: The system solving approach, implementation and benchmarks (Q1199708) (← links)
- A general refutational completeness result for an inference procedure based on associative-commutative unification (Q1209615) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Adventures in associative-commutative unification (Q1262757) (← links)
- Competing for the \(AC\)-unification race (Q1319390) (← links)
- A formally verified solver for homogeneous linear Diophantine equations (Q1791187) (← links)
- Unification in permutative equational theories is undecidable (Q1825190) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- (Q3805960) (← links)
- On the unification problem for Cartesian closed categories (Q4358059) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- Formalising nominal C-unification generalised with protected variables (Q5022930) (← links)
- Open problems in rewriting (Q5055780) (← links)
- AC-complete unification and its application to theorem proving (Q5055849) (← links)
- “Syntactic” AC-unification (Q5096305) (← links)
- Building Theorem Provers (Q5191110) (← links)
- On pot, pans and pudding or how to discover generalised critical Pairs (Q5210806) (← links)
- (Q5216313) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
