Bounded Second-Order Unification Is NP-Complete

Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret. Bounded Second-Order Unification Is NP-Complete. In Frank Pfenning, editor, Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings. Volume 4098 of Lecture Notes in Computer Science, pages 400-414, Springer, 2006. [doi]

Abstract

Abstract is missing.