A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms

DOI10.1007/3-540-62950-5_78zbMath1379.68205OpenAlexW1506801966MaRDI QIDQ4594235

Klaus U. Schulz

Publication date: 17 November 2017

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-62950-5_78

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Efficient general AGH-unification

This page was built for publication: A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms