Decidability of unification in the theory of one-sided distributivity and a multiplicative unit

DOI10.1006/JSCO.1996.0054MaRDI QIDQ674747zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

one-sided distributivity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 517006
• scientific article; zbMATH DE number 3921959
• Unification problems with one-sided distributivity
• New algorithms for unification modulo one-sided distributivity and its variants

Cited in

(13)

• scientific article; zbMATH DE number 517006 (Why is no real title available?)
• On unification modulo one-sided distributivity: algorithms, variants and asymmetry
• Some results on equational unification
• 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
• scientific article; zbMATH DE number 3921959 (Why is no real title available?)

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)