Patrick Prosser Explained

Patrick Prosser
Birth Date:8 September 1952
Birth Place:Glasgow, Scotland
Nationality:Scottish
Fields:Constraint programming
Workplaces:University of Glasgow
Alma Mater:Strathclyde University
Doctoral Advisor:Iain Buchanan
Known For:Conflict-directed backjumping

Patrick Prosser (born 8 September 1952) is a Computer Scientist who spent the bulk of his career at the University of Glasgow. His research has centred on constraint programming, although it has extended into the application of those techniques into other areas. For his major contributions to the theory and practice of constraint programming, Patrick was awarded the Association for Constraint Programming's Research Excellence Award on 15 September 2011: he is only the sixth recipient of this award.[1] He gave a prerecorded acceptance speech, which is available on YouTube.[2]

His most notable contribution is his invention of conflict-directed backjumping, an advanced technique for reducing search in constraint problems by avoiding unnecessary work on backtracking. His 1993 paper[3] describing this has been widely cited.[4]

Other areas of constraint programming he has researched include the identification of hard problems[5] and techniques for solving vehicle routing problems.[6] His interest in applications of constraint programming has included (for example) how it can be used in computing species trees.[7]

Amongst his recreations is kite flying as a founder of the Kite Club of Scotland. He has written about the Tetrahedral kite.[8]

External links

Notes and References

  1. http://4c110.ucc.ie/acp/a4cp/awards/research-excellence-award Association for Constraint Programming's Research Excellence Award website.
  2. https://www.youtube.com/playlist?list=PLB09ABCAFDFBDFBB5&feature=mh_lolz Patrick Prosser's video acceptance speech playlist on Youtube.
  3. https://archive.today/20121010012258/http://www3.interscience.wiley.com/journal/119980046/abstract?CRETRY=1&SRETRY=0 HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, 1993, Vol 9, pages 268-299
  4. https://scholar.google.co.uk/scholar?hl=en&lr=&q=prosser+constraint&btnG=Search Google Scholar search
  5. https://archive.today/20120919055938/http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYF-3VSNHP6-5&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=d494a7cdee2e6cca694148e00f586e9a An empirical study of phase transitions in binary constraint satisfaction problems, Artificial Intelligence, 1996, Vol 81, pages 81-109.
  6. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics . 10.1023/A:1009621410177 . 2000 . Backer . Bruno De . Furnon . Vincent . Shaw . Paul . Kilby . Philip . Prosser . Patrick . Journal of Heuristics . 6 . 4 . 501–523 . 15296616 .
  7. http://www.jair.org/papers/paper2580.html N. C. A. Moore and P. Prosser (2008) "The Ultrametric Constraint and its Application to Phylogenetics", JAIR, Volume 32, pages 901-938
  8. http://www.dcs.gla.ac.uk/~pat/tet.ps The tetrahedral principle in kite design, revisited, Patrick Prosser, 1996