Keyword

unification algorithms

Description: Unification algorithms are methods in logic and computer science for finding substitutions that make symbolic expressions equal.
Wikidata ID: wiki/Q609057
OpenAlex ID: keywords/unification-algorithms
1982 · Alberto Martelli, Ugo Montanari · ACM Transactions on Programming Languages and Systems · 933
1975 · G.P. Huet · Theoretical Computer Science · 657
1980 · Jean-Marie Hullot · Lecture notes in computer science · 462
1981 · Gerald E. Peterson, Mark E. Stickel · Journal of the ACM · 458
1986 · Jean-Pierre Jouannaud, Hélène Kirchner · SIAM Journal on Computing · 424
1978 · M.S. Paterson, M.N. Wegman · Journal of Computer and System Sciences · 398
1988 · J -L. Lassez, M. J. Maher, et al. · Elsevier eBooks · 376
1989 · Kevin Knight · ACM Computing Surveys · 282
1981 · Mark E. Stickel · Journal of the ACM · 267
2003 · H. Comon-Lundh, V. Shmatikov · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 182
1990 · You-Chin Fuh, Prateek Mishra · Theoretical Computer Science · 155
1984 · Bledsoe, W. W., Loveland, D. W. · Contemporary mathematics - American Mathematical Society · 148
1989 · Wayne Snyder, Jean Gallier · Journal of Symbolic Computation · 131
1991 · Fritz Henglein · Lecture notes in computer science · 125
2001 · Gilles Dowek · Elsevier eBooks · 120
2003 · F. Pfenning · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 119
1991 · Hubert Comon · 119
1987 · Wolfram Buttner, Helmut Simonis · Journal of Symbolic Computation · 117
1993 · T. Nipkow · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 116
1996 · Agostino Dovier, Eugenio G. Omodeo, et al. · The Journal of Logic Programming · 103
1986 · Jean Fargues, Marie-Claude Landau, et al. · IBM Journal of Research and Development · 101
1991 · John T. Maxwell, Ronald M. Kaplan · Springer eBooks · 99
Works count: 818
Citation count: 13,210
Year
Topic
Type