New algorithms for unification modulo one-sided distributivity and its variants

DOI10.1007/978-3-642-31365-3_32zbMATH Open1358.03030OpenAlexW1865203519MaRDI QIDQ2908511FDOQ2908511

Authors Andrew M. Marshall, Paliath Narendran

Publication date 5 September 2012

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31365-3_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)

Recommendations

• On unification modulo one-sided distributivity: algorithms, variants and asymmetry
• Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
• scientific article; zbMATH DE number 3921959
• Unification problems with one-sided distributivity
• scientific article; zbMATH DE number 517006

Cited in

(4)

• On unification modulo one-sided distributivity: algorithms, variants and asymmetry
• One context unification problems solvable in polynomial time
• Unification Modulo Chaining
• scientific article; zbMATH DE number 1929957 (Why is no real title available?)

This page was built for publication: New algorithms for unification modulo one-sided distributivity and its variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908511)