John Alan Robinson

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For the former politician in Ontario, Canada, see Alan Robinson. For the rugby league footballer for Ireland, and Coventry Bears, see Alan Robinson (rugby league).
John Alan Robinson
John Alan Robinson IMG 0493.jpg
John Alan Robinson in 2012
Born 1928
Institutions Syracuse University
Alma mater Cambridge University
University of Oregon
Princeton University
Thesis Causation, probability and testimony (1957)
Doctoral advisor Carl Hempel[1]
Known for resolution principle, unification
Notable awards AMS Milestone Award 1985, Humboldt Senior Scientist Award 1995, Herbrand Award 1996

John Alan Robinson (born 1928)[2] is a philosopher (by training), mathematician and computer scientist. He is University Professor Emeritus at Syracuse University, United States.

Alan Robinson's major contribution is to the foundations of automated theorem proving. His unification algorithm eliminated one source of combinatorial explosion in resolution provers; it also prepared the ground for the logic programming paradigm, in particular for the Prolog language. Robinson received the 1996 Herbrand Award for Distinguished Contributions to Automated Reasoning.

Life[edit]

Robinson was born in Yorkshire, England and left for the United States in 1952 with a classics degree from Cambridge University. He studied philosophy at the University of Oregon before moving to Princeton University where he received his PhD in philosophy in 1956. He then worked at Du Pont as an operations research analyst, where he learned programming and taught himself mathematics. He moved to Rice University in 1961, spending his summers as a visiting researcher at the Argonne National Laboratory's Applied Mathematics Division. He moved to Syracuse University as Distinguished Professor of Logic and Computer Science in 1967 and became professor emeritus in 1993.[citation needed]

It was at Argonne that Robinson became interested in automated theorem proving and developed unification and the resolution principle. Resolution and unification have since been incorporated in many automated theorem-proving systems and are the basis for the inference mechanisms used in logic programming and the programming language Prolog.

Robinson was the Founding Editor of the Journal of Logic Programming, and has received numerous honours. These include a Guggenheim Fellowship in 1967, the American Mathematical Society Milestone Award in Automatic Theorem Proving 1985,[3] an AAAI Fellowship 1990,[4] the Humboldt Foundation Senior Scientist Award 1995,[citation needed] the Herbrand Award for Distinguished Contributions to Automatic Reasoning 1996,[5][6] and the Association for Logic Programming honorary title Founder of Logic Programming in 1997.[7] He has received Honorary Doctorates from Katholieke Universiteit Leuven 1988,[8] Uppsala University 1994,[9] and Universidad Politecnica de Madrid 2003.[10][11]

Selected publications[edit]

See also[edit]

Notes[edit]

External links[edit]