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 “"Paterson-Wegman unification algorithm"”.

  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. Parallel algorithms for free and associative-commutative unification

    A survey of algorithms for free unification is given, followed by an overview of the computability and complexity of unification problems. Second-order unification is known to be undecidable, and a proof is given that the first-order problem is also undecidable under an arbitrary set of axioms. A …

    oxford Repository record for Parallel algorithms for free and associative-commutative unification (opens in a new tab)