scientific article; zbMATH DE number 3870644

From MaRDI portal
Publication:3336740





[For the entire collection see Zbl 0537.00025.] The author describes a linear time algorithm for the following problem: given a set \(\{(a_ i,b_ i)| 1\leq i\leq n\}\) (where for all 1\(\leq i\leq n\), \(a_ i\) is a first-order constant or variable, or a term g(x) where g is a second-order constant or variable and x is a first-order constant or variable, and \(b_ i\) is an expression in normal form) find a unifier \(\alpha\) such that \(\alpha a_ i=b_ i\), for all 1\(\leq i\leq n\).











This page was built for publication:

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