- unification algorithm
- мат. алгоритм унификации
Большой англо-русский и русско-английский словарь. 2001.
unification algorithm
Смотреть что такое "unification algorithm" в других словарях:
Unification (computer science) — Unification, in computer science and logic, is an algorithmic process by which one attempts to solve the satisfiability problem. The goal of unification is to find a substitution which demonstrates that two seemingly different terms are in fact… … Wikipedia
Unification — In mathematical logic, in particular as applied to computer science, a unification of two terms is a join (in the lattice sense) with respect to a specialisation order. That is, we suppose a preorder on a set of terms, for which t * ≤ t means… … Wikipedia
Semantic unification — has a long history in fields like philosophy and linguistics. In computer science it has been used in different research areas like grammar unification [1] [2] , and Prolog extensions [3] . For business processes and workflow management the term… … Wikipedia
Nominal terms (computer science) — Nominal terms are a metalanguage for embedding object languages with binding constructs into. Intuitively, they may be seen as an extension of first order terms with support for name binding. Consequently, the native notion of equality between… … Wikipedia
Occurs check — In computer science, the occurs check is a part of algorithms for syntactic unification. It causes unification of a logic variable V and a structure S to fail if S contains V. In theorem proving, unification without the occurs check can lead to… … Wikipedia
Gérard Huet — Gérard Huet, born in Bourges on July 7 1947, is a French computer scientist.Graduated from: * Université Denis Diderot (Paris VII) * Case Western Reserve University * Université de Paris * His specialties are: * Software architecture * Design of… … Wikipedia
Richard Waldinger — Richard J. Waldinger is a computer science researcher at SRI Artificial Intelligence Laboratory (where he has worked since 1969) whose interests focus on the application of automated deductive reasoning to problems in software engineering and… … Wikipedia
Typed lambda calculus — A typed lambda calculus is a typed formalism that uses the lambda symbol (lambda) to denote anonymous function abstraction. Typed lambda calculi are foundational programming languages and are the base of typed functional programming languages… … Wikipedia
History of artificial intelligence — The history of artificial intelligence begins in antiquity with myths, stories and rumors of artificial beings endowed with intelligence and consciousness by master craftsmen. In the middle of the 20th century, a handful of scientists began to… … Wikipedia
LF (logical framework) — In type theory, the LF logical framework provides a means to define (or present) logics. It is based on a general treatment of syntax, rules and proofs by means of a dependently typed lambda calculus. Syntax is treated in a style similar to, but… … Wikipedia
Principal type — In Type theory, the Principal type of an expression is the most general possible type given an expression.One way to compute the Principal type of an expression is by deploying Robinson s unification algorithm, which is used by Prolog … Wikipedia
