Unification and matching modulo nilpotence
From MaRDI portal
Recommendations
Cites work
- A decision algorithm for distributive unification
- An Efficient Unification Algorithm
- Complexity of unification problems with associative-commutative operators
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- scientific article; zbMATH DE number 4049047 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1348479 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1555173 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- On the unification problem for Cartesian closed categories
- The Clausal Theory of Types
- The complexity of satisfiability problems
- The undecidability of the second-order unification problem
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Unification in monoidal theories
Cited in
(10)- Complexity of nilpotent unification and matching problems.
- Unification algorithms cannot be combined in polynomial time.
- Unification modulo lists with reverse relation with certain word equations
- Unification Modulo Chaining
- Efficient general AGH-unification
- scientific article; zbMATH DE number 1929957 (Why is no real title available?)
- scientific article; zbMATH DE number 845925 (Why is no real title available?)
- Extensions of unification modulo ACUI
- Equational Theorem Proving for Clauses over Strings
- Equational theorem proving for clauses over strings
This page was built for publication: Unification and matching modulo nilpotence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647522)