Unification modulo associativity and idempotency is NP-complete
From MaRDI portal
Recommendations
- Matching modulo associativity and idempotency is NP-complete
- Complexity of unification problems with associative-commutative operators
- On the parameterized complexity of associative and commutative unification
- On the parameterized complexity of associative and commutative unification
- Unification and matching modulo nilpotence
- scientific article; zbMATH DE number 4049047
- Complexity of nilpotent unification and matching problems.
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- New algorithms for unification modulo one-sided distributivity and its variants
- Unification Modulo Chaining
Cited in
(1)
This page was built for publication: Unification modulo associativity and idempotency is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708591)