Deepak Kapur, Paliath Narendran. NP-Completeness of the Set Unification and Matching Problems. In Jörg H. Siekmann, editor, 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings. Volume 230 of Lecture Notes in Computer Science, pages 489-495, Springer, 1986.
Abstract is missing.