Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Unification_(computer_science)> ?p ?o }
- Unification_(computer_science) abstract "Unification, in computer science and logic, is an algorithmic process of solving equations between symbolic expressions.Depending on which expressions (also called terms) are allowed to occur in an equation set (also called unification problem), and which expressions are considered equal, several frameworks of unification are distinguished. If higher-order variables, that is, variables representing functions, are allowed in an expression, the process is called higher-order unification, otherwise first-order unification. If a solution is required to make both sides of each equation literally equal, the process is called syntactical unification, otherwise semantical, or equational unification, or E-unification, or unification modulo theory.A solution of a unification problem is denoted as a substitution, that is, a mapping assigning a symbolic value to each variable of the problem's expressions. A unification algorithm should compute for a given problem a complete, and minimal substitution set, that is, a set covering all its solutions, and containing no redundant members. Depending on the framework, a complete and minimal substitution set may have at most one, at most finitely many, or possibly infinitely many members, or may not exist at all. In some frameworks it is generally impossible to decide whether any solution exists. For first-order syntactical unification, Martelli and Montanari gave an algorithm that reports unsolvability or computes a complete and minimal singleton substitution set containing the so-called most general unifier.For example, using x,y,z as variables, the singleton equation set { cons(x,cons(x,nil)) = cons(2,y) } is a syntactic first-order unification problem that has the substitution { x ↦ 2, y ↦ cons(2,nil) } as its only solution.The syntactic first-order unification problem { y = cons(2,y) } has no solution over the set of finite terms; however, it has the single solution { y ↦ cons(2,cons(2,cons(2,...))) } over the set of infinite trees.The semantic first-order unification problem { a⋅x = x⋅a } has each substitution of the form { x ↦ a⋅...⋅a } as a solution in a semigroup, i.e. if (⋅) is considered associative; the same problem, viewed in an abelian group, where (⋅) is considered also commutative, has any substitution at all as a solution.The singleton set { a = y(x) } is a syntactic second-order unification problem, since y is a function variable.One solution is { x ↦ a, y ↦ (identity function) }; another one is { y ↦ (constant function mapping each value to a), x ↦ (any value) }.The first formal investigation of unification can be attributed to John Alan Robinson, who used first-order syntactical unification as a basic building block of his resolution procedure for first-order logic, a great step forward in automated reasoning technology, as it eliminated one source of combinatorial explosion: searching for instantiation of terms. Today, automated reasoning is still the main application area of unification.Syntactical first-order unification is used in logic programming and programming language type system implementation, especially in Hindley–Milner based type inference algorithms.Semantic unification is used in SMT solvers and term rewriting algorithms.Higher-order unification is used in proof assistants, for example Isabelle and Twelf, and restricted forms of higher-order unification (higher-order pattern unification) are used in some programming language implementations, such as lambdaProlog, as higher-order patterns are expressive, yet their associated unification procedure retains theoretical properties closer to first-order unification.".
- Unification_(computer_science) wikiPageExternalLink sem.html.
- Unification_(computer_science) wikiPageExternalLink UnifChapter.pdf.
- Unification_(computer_science) wikiPageExternalLink TRaAT.
- Unification_(computer_science) wikiPageID "54432".
- Unification_(computer_science) wikiPageLength "61658".
- Unification_(computer_science) wikiPageOutDegree "129".
- Unification_(computer_science) wikiPageRevisionID "676817166".
- Unification_(computer_science) wikiPageWikiLink Abelian_group.
- Unification_(computer_science) wikiPageWikiLink Admissible_rule.
- Unification_(computer_science) wikiPageWikiLink Algebraic_specification.
- Unification_(computer_science) wikiPageWikiLink Algorithm.
- Unification_(computer_science) wikiPageWikiLink Algorithms.
- Unification_(computer_science) wikiPageWikiLink Andrei_Voronkov.
- Unification_(computer_science) wikiPageWikiLink Anti-unification_(computer_science).
- Unification_(computer_science) wikiPageWikiLink Arity.
- Unification_(computer_science) wikiPageWikiLink Associative.
- Unification_(computer_science) wikiPageWikiLink Associative_property.
- Unification_(computer_science) wikiPageWikiLink Automated_reasoning.
- Unification_(computer_science) wikiPageWikiLink Boolean_ring.
- Unification_(computer_science) wikiPageWikiLink Category:Automated_theorem_proving.
- Unification_(computer_science) wikiPageWikiLink Category:Logic_in_computer_science.
- Unification_(computer_science) wikiPageWikiLink Category:Logic_programming.
- Unification_(computer_science) wikiPageWikiLink Category:Rewriting_systems.
- Unification_(computer_science) wikiPageWikiLink Category:Type_theory.
- Unification_(computer_science) wikiPageWikiLink Category:Unification_(computer_science).
- Unification_(computer_science) wikiPageWikiLink Christoph_Walther.
- Unification_(computer_science) wikiPageWikiLink Closure_(mathematics).
- Unification_(computer_science) wikiPageWikiLink Commutative.
- Unification_(computer_science) wikiPageWikiLink Commutative_property.
- Unification_(computer_science) wikiPageWikiLink Commutative_ring.
- Unification_(computer_science) wikiPageWikiLink Commutativity.
- Unification_(computer_science) wikiPageWikiLink Computer_science.
- Unification_(computer_science) wikiPageWikiLink Conor_McBride.
- Unification_(computer_science) wikiPageWikiLink Cons.
- Unification_(computer_science) wikiPageWikiLink Constant_function.
- Unification_(computer_science) wikiPageWikiLink Dale_Miller_(computer_scientist).
- Unification_(computer_science) wikiPageWikiLink Decidable_problem.
- Unification_(computer_science) wikiPageWikiLink Decision_problem.
- Unification_(computer_science) wikiPageWikiLink Dependent_type.
- Unification_(computer_science) wikiPageWikiLink Directed_acyclic_graph.
- Unification_(computer_science) wikiPageWikiLink Dis-unification_(computer_science).
- Unification_(computer_science) wikiPageWikiLink Ellipsis_(linguistics).
- Unification_(computer_science) wikiPageWikiLink Elliptical_construction.
- Unification_(computer_science) wikiPageWikiLink Empty_theory.
- Unification_(computer_science) wikiPageWikiLink Epigram_(programming_language).
- Unification_(computer_science) wikiPageWikiLink Equality_(mathematics).
- Unification_(computer_science) wikiPageWikiLink Equation.
- Unification_(computer_science) wikiPageWikiLink Equation_solving.
- Unification_(computer_science) wikiPageWikiLink Equations.
- Unification_(computer_science) wikiPageWikiLink Equivalence_relation.
- Unification_(computer_science) wikiPageWikiLink Explicit_substitution.
- Unification_(computer_science) wikiPageWikiLink Expression_(mathematics).
- Unification_(computer_science) wikiPageWikiLink First-order_logic.
- Unification_(computer_science) wikiPageWikiLink Franz_Baader.
- Unification_(computer_science) wikiPageWikiLink Free_object.
- Unification_(computer_science) wikiPageWikiLink Free_theory.
- Unification_(computer_science) wikiPageWikiLink Gérard_Huet.
- Unification_(computer_science) wikiPageWikiLink Handbook_of_Automated_Reasoning.
- Unification_(computer_science) wikiPageWikiLink Haskell_(programming_language).
- Unification_(computer_science) wikiPageWikiLink Higher-order_pattern_unification.
- Unification_(computer_science) wikiPageWikiLink Hindley–Milner.
- Unification_(computer_science) wikiPageWikiLink Hindley–Milner_type_system.
- Unification_(computer_science) wikiPageWikiLink Idempotence.
- Unification_(computer_science) wikiPageWikiLink Idempotent.
- Unification_(computer_science) wikiPageWikiLink Identity_function.
- Unification_(computer_science) wikiPageWikiLink Infix_notation.
- Unification_(computer_science) wikiPageWikiLink Isabelle_(proof_assistant).
- Unification_(computer_science) wikiPageWikiLink Isabelle_(theorem_prover).
- Unification_(computer_science) wikiPageWikiLink J._Alan_Robinson.
- Unification_(computer_science) wikiPageWikiLink Jan_van_Leeuwen.
- Unification_(computer_science) wikiPageWikiLink Jean-Pierre_Jouannaud.
- Unification_(computer_science) wikiPageWikiLink John_Alan_Robinson.
- Unification_(computer_science) wikiPageWikiLink Joseph_Goguen.
- Unification_(computer_science) wikiPageWikiLink Kripke_semantics.
- Unification_(computer_science) wikiPageWikiLink LambdaProlog.
- Unification_(computer_science) wikiPageWikiLink Lambda_calculus.
- Unification_(computer_science) wikiPageWikiLink Lambda_term.
- Unification_(computer_science) wikiPageWikiLink Lexicographic_order.
- Unification_(computer_science) wikiPageWikiLink Lexicographical_order.
- Unification_(computer_science) wikiPageWikiLink Lisp_(programming_language).
- Unification_(computer_science) wikiPageWikiLink Logic.
- Unification_(computer_science) wikiPageWikiLink Logic_programming.
- Unification_(computer_science) wikiPageWikiLink Many-sorted_logic.
- Unification_(computer_science) wikiPageWikiLink Modal_algebra.
- Unification_(computer_science) wikiPageWikiLink Nachum_Dershowitz.
- Unification_(computer_science) wikiPageWikiLink Occurs_check.
- Unification_(computer_science) wikiPageWikiLink Overloading_(programming).
- Unification_(computer_science) wikiPageWikiLink Parametric_polymorphism.
- Unification_(computer_science) wikiPageWikiLink Polymorphism_(computer_science).
- Unification_(computer_science) wikiPageWikiLink Postfix_notation.
- Unification_(computer_science) wikiPageWikiLink Power_set.
- Unification_(computer_science) wikiPageWikiLink Prolog.
- Unification_(computer_science) wikiPageWikiLink Recursive_definition.
- Unification_(computer_science) wikiPageWikiLink Resolution_(logic).
- Unification_(computer_science) wikiPageWikiLink Reverse_Polish_notation.
- Unification_(computer_science) wikiPageWikiLink Rewriting.
- Unification_(computer_science) wikiPageWikiLink SMT_solver.
- Unification_(computer_science) wikiPageWikiLink Satisfiability_modulo_theories.
- Unification_(computer_science) wikiPageWikiLink Semi-decidable.