Unification and matching modulo nilpotence
From MaRDI portal
Publication:4647522
DOI10.1007/3-540-61511-3_90zbMATH Open1412.68229OpenAlexW1602675124MaRDI QIDQ4647522FDOQ4647522
Authors: Qing Guo, Paliath Narendran, D. A. Wolfram 
Publication date: 15 January 2019
Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61511-3_90
Recommendations
Cites Work
- Title not available (Why is that?)
- The complexity of satisfiability problems
- An Efficient Unification Algorithm
- Title not available (Why is that?)
- Complexity of unification problems with associative-commutative operators
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Title not available (Why is that?)
- On the unification problem for Cartesian closed categories
- The Clausal Theory of Types
- Unification in monoidal theories
- Title not available (Why is that?)
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The undecidability of the second-order unification problem
- Title not available (Why is that?)
- A decision algorithm for distributive unification
Cited In (9)
- Unification algorithms cannot be combined in polynomial time.
- Complexity of nilpotent unification and matching problems.
- Title not available (Why is that?)
- Efficient general AGH-unification
- Extensions of unification modulo ACUI
- Title not available (Why is that?)
- Unification modulo lists with reverse relation with certain word equations
- Unification Modulo Chaining
- 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)
