Unification
Unification is a formal method in logic programming that belongs to the class of syntactic matching procedures, differing from its counterparts by specifically computing the most general substitution that makes two logical expressions identical under predicate calculus.
2.8K
Publications
176.9K
Citations
4.3K
Authors
1.5K
Institutions
Publications per year
2017–2026
297
Parents
2.8K
Barygenesis without grand unification
M. Fukugita, T. Yanagida · Physics Letters B · 1986 · 3.9K citations
On Two Metaphors for Learning and the Dangers of Choosing Just One
Anna Sfard · Educational Researcher · 1998 · 3.6K citations
Philip Kitcher · Philosophy of Science · 1981 · 1.1K citations · Full text
1–5 of 2.8K
4.3K
16
h-index
15
h-index
University of Maryland, College Park, United States
15 publications · 1.2K citations
14
h-index
13
h-index
12
h-index
1–5 of 4.3K
1.5K
Stanford University
Stanford, United States
36 h-index
91 publications
15.8K citations

European Organization for Nuclear Research
Geneva, Switzerland
34 h-index
78 publications
10.9K citations
University of Pennsylvania
Philadelphia, United States
33 h-index
62 publications
6.2K citations
University of California, Berkeley
Berkeley, United States
33 h-index
83 publications
11.6K citations

Lawrence Berkeley National Laboratory
Berkeley, United States
31 h-index
79 publications
11.4K citations
The University of Tokyo
Tokyo, Japan
28 h-index
97 publications
5.1K citations
University of Cambridge
Cambridge, United Kingdom
25 h-index
38 publications
2.8K citations
University of Maryland, College Park
College Park, United States
24 h-index
57 publications
4.5K citations
1–8 of 1.5K
153 publications · 14.8K citations
58
h-index
143 publications · 14.5K citations
50
h-index
PRL · 67 publications · 6.8K citations
46
h-index
122 publications · 5.3K citations
42
h-index
JHEP · 85 publications · 4.2K citations
35
h-index
1–5