Igor Prívara

Learn More
Further asymptotical improvement of original Robinson's unification idea is presented. By postponing the so-called occur-check in Corbin and Bidoit's quadratic rehabilitation of the Robinson algorithm at the end of unification an almost linear unification algorithm is obtained. In the worst case, the resulting algorithm has the time complexity O(p · A(p)),(More)
  • 1