Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
From MaRDI portal
Publication:674747
DOI10.1006/JSCO.1996.0054zbMATH Open0865.68065OpenAlexW2165268511MaRDI QIDQ674747FDOQ674747
Authors: Manfred Schmidt-Schauß 
Publication date: 6 March 1997
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1996.0054
Recommendations
Cited In (13)
- Title not available (Why is that?)
- Some results on equational unification
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- The first-order theory of linear one-step rewriting is undecidable
- On rewrite constraints and context unification
- An algorithm for distributive unification
- Unification problems with one-sided distributivity
- Cadmium: An Implementation of ACD Term Rewriting
- A decision algorithm for distributive unification
- Unification modulo synchronous distributivity
- New algorithms for unification modulo one-sided distributivity and its variants
- Unification modulo ACUI plus distributivity axioms
- Title not available (Why is that?)
This page was built for publication: Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674747)
