Skip to search formSkip to main contentSkip to account menu

Unification (computer science)

Known as: Unification (computing), Syntactic unification, Unification 
In logic and computer science, unification is an algorithmic process of solving equations between symbolic expressions. Depending on which… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Admissible ruleAlgebraic specificationComputer scienceConstant function

Broader (3)

Automated theorem provingLogic programmingType theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Computational Methods in Engineering: A Variety ofPrimal & Mixed Methods, with Global & LocalInterpolations, for Well-Posed or Ill-Posed BCs
In this expository article, a variety of computational methods, such as Collocation, Finite Volume, Finite Element, Boundary… 
2012
2012
Higgs boson of mass 125 GeV in GMSB models with messenger-matter mixing
We investigate the effects of messenger–matter mixing on the lightest CP–even Higgs boson mass mh in gauge–mediated supersymmetry… 
1994
1994
Common channel signaling networks: past, present, future
The authors wish to provide a unification of this issue's papers by providing a clear context for them. Common channel signaling… 
Highly Cited
1993
Highly Cited
1993
Order-sorted polymorphism in Isabelle
ML-style polymorphism can be generalized from a single-sorted algebra of types to an order-sorted one by adding a partially… 
1993
1993
Head-driven Parsing for Lexicalist Grammars: Experimental Results
We present evidence that head-driven parsing strategies lead to efficiency gains over standard parsing strategies, for lexicalist… 
Highly Cited
1990
Highly Cited
1990
Parasitic gaps and the theory of 'Wh'-chains
1988
1988
Time variation of gravitational constant in multidimensional cosmology
SummaryIn the framework of (4+N)-dimensional cosmology with an isotropic 3-space and a Ricci-flat internal space a relation… 
Highly Cited
1986
Highly Cited
1986
Natural language parsing with combinatory categorial grammar in a graph-unification-based formalism
1983
1983
Resolution by Unification and Equality
In resolution by unification and equality, we recast the theory of binary resolution on the basis of the properties of the… 
Highly Cited
1979
Highly Cited
1979
Unified Design of Self-Checking and Fail-Safe Combinational Circuits and Sequential Machines
This correspondence deals with a unification and extension of some previous work on self-checking (SC) and fail-safe (FS) systems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)