NP-completeness of the set unification and matching problems

This publication has 4 references indexed in Scilit:

• An equational approach to theorem proving in first-order predicate calculus
  ACM SIGSOFT Software Engineering Notes, 1985
• Refutational theorem proving using term-rewriting systems
  Artificial Intelligence, 1985
• Complexity of matching problems
  Published by Springer Nature ,1985
• Linear unification
  Journal of Computer and System Sciences, 1978