STICKEL, M.E. A complete unification algorithm for associative-commutative functions. In Proceedings of the 4th International Joint Conference on Artificial ...
|
A complete unification algorithm for associative-commutative functions, 1975 Article. Bibliometrics Data Bibliometrics. · Downloads (6 Weeks): n/a · Downloads ...
|
||
The algorithm is expressed partially in terms of an algorithm for the complete unification of terms with an associative and commutative function with only ...
|
||
|
Occurs check - Wikipedia, the free encyclopedia
en.wikipedia.org/wiki/Occurs_check
In theorem proving, unification without the occurs check can lead to unsound inference. ... Weijland (1990) defines a complete unification algorithm in terms of ... |
||
bobmoore@microsoft.com. Abstract. This paper describes an efficient sentence- realization algorithm that is complete for a very general class of unification gram ...
|
||
of unification for which the complete unification algorithm terminates in. PTIME. ... general. A complete unification algorithm is presented that runs in EXPTIME.
|
|
|
unification algorithm can be obtained. Hullot's basic narrowing [8] is one such strategy, which is complete, uses only normalized unifiers, and terminates under ...
|
||
Analysis of the Algorithm The complete unification algorithm consists in calling once HERE(t, t') and, if it succeeds, calling VERE(U) for all variables in the two ...
|
||
that P ~ NP, that any complete unification algorithm for disjunctive descriptions wiU require exponential time in the worst case. However, this result does not ...
|
||
complete unification algorithm based on AC1-unification for equational systems consisting only of. products has been given by Contejean [Con93]. We use the ...
|
Related Topics
