Assertion: graph | /r/HasProperty | consistent
Facets:
Source sentences:
text: The unification of two argument graphs is defined as the most general graph (or the computation thereof) that is consistent with (i.e. contains all of the information in) the inputs, if such a graph exists; efficient unification algorithms are known.