Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"efficient unification"”.

  1. Linear Unification

    Efficient unification is considered within the context of logic programming. Unification is explained in terms of equivalence classes made up of terms, where there is a constraint that no equivalence class may contain more than one function term. It is demonstrated that several well-known …

    unt Repository record for Linear Unification (opens in a new tab)

  2. Array TFS storage for unification grammars

    … analyses. In particular, graph <italic>unification</italic>--the computation of the most general structure that is consistent with a set of argument graphs (if such a structure exists)--can be interpreted as expressing the satisfiability and combination functions for the represented …

    washington Repository record for Array TFS storage for unification grammars (opens in a new tab)