We introduce a class of counting problems that arise naturally in equational matching and study their computational complexity. If E is an equational theory, then #E-Matching is the problem of counting the number of complete minimal E-matchers of two given terms. #E-Matching is a well-deened algorithmic problem for every nitary equational theory. Moreover, it captures more accurately the comput...
