We demonstrate that deciding if two terms containing otherwise uninterpreted associative, commutative, and associative-commutative function symbols and commutative variable-binding operators are equal is polynomially equivalent to determining if two graphs are isomorphic. The reductions we use provide insight into this result and suggest polynomial time special cases.
CITATION STYLE
Basin, D. A. (1990). Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 449 LNAI, pp. 251–260). Springer Verlag. https://doi.org/10.1007/3-540-52885-7_92
Mendeley helps you to discover research relevant for your work.