3.3.3 The category-theoretic point of view

Let Γ : = { s i = E ? t i | i = 1 , , n } si265_e be an E-unification problem over F si266_e , and X : = V a r ( Γ ) si267_e be the finite set of variables occurring in Γ. Since all our calculations are done modulo E, we may consider the terms s i and t i as elements of T ( F , X ) / = E , the .E-free algebra with generators X . For example, let F consist of a binary ...

Get Handbook of Automated Reasoning now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.