\(E\)-unification with constants vs. general \(E\)-unification

DOI10.1007/s10817-010-9201-2zbMath1260.03019OpenAlexW1981828430MaRDI QIDQ438584

Jan Otop

Publication date: 31 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9201-2

zbMATH Keywords

\(E\)-unification with constantscombination problemgeneral \(E\)-unification

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items (1)

Model measuring for discrete and hybrid systems

Cites Work

• Unification in a combination of arbitrary disjoint equational theories
• Complexity of unification problems with associative-commutative operators
• Unification in commutative idempotent monoids
• Single versus simultaneous equational unification and equational unification for variable-permuting theories
• Unification in the union of disjoint equational theories: Combining decision procedures
• Fast Decision Procedures Based on Congruence Closure
• Term Rewriting and All That
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(E\)-unification with constants vs. general \(E\)-unification