A term in discrete mathematics, including graph theory, and specifically conceptual graph theory.
A binary relation is a relation which relates two things.
A term in graph theory.
It must then also be true that all of the arcs of the graph "cross the boundary" between the two sets A and B. That is, any arc must either:
That is, any arc must connect one node from A and one node from B.
A term in Prolog.
Bound variables can have their bindings broken, which means that the variable becomes free again. This typically happens when backtracking occurs.
A variable can share with another variable, which means that the variable is bound to whatever value the other variable has. If the other variable is still free, the variable that share with the other variable is also free. When one of the variables is bound to a value, both variables are bound to the same value.