Difference between revisions of "Maarten van Emden"

From Chessprogramming wiki
Jump to: navigation, search
 
(One intermediate revision by the same user not shown)
Line 25: Line 25:
  
 
=Selected Publications=  
 
=Selected Publications=  
<ref>[http://webhome.cs.uvic.ca/%7Evanemden/downloads.html Downloads MHvE]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/e/Emden:M=_H=_van dblp: M. H. van Emden]</ref> <ref>[https://scholar.google.com/citations?user=C2QJcnoAAAAJ&hl=en Maarten van Emden - Google Scholar Citations]</ref>
+
<ref>[http://webhome.cs.uvic.ca/%7Evanemden/downloads.html Downloads MHvE]</ref> <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/e/Emden:M=_H=_van dblp: M. H. van Emden]</ref> <ref>[https://scholar.google.com/citations?user=C2QJcnoAAAAJ&hl=en Maarten van Emden - Google Scholar Citations]</ref>
 
==1970 ...==
 
==1970 ...==
 
* [[Maarten van Emden]] ('''1970'''). ''[https://dl.acm.org/citation.cfm?id=362753 Increasing the efficiency of quicksort]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 9 <ref>[https://en.wikipedia.org/wiki/Quicksort Quicksort from Wikipedia]</ref>
 
* [[Maarten van Emden]] ('''1970'''). ''[https://dl.acm.org/citation.cfm?id=362753 Increasing the efficiency of quicksort]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 9 <ref>[https://en.wikipedia.org/wiki/Quicksort Quicksort from Wikipedia]</ref>
Line 42: Line 42:
 
* [[Maarten van Emden]], [https://dblp.uni-trier.de/pers/hd/s/Szeredi:P=eacute=ter Péter Szeredi] ('''1988'''). ''[https://www.sciencedirect.com/science/article/pii/B9780934613408500221 Converting AND-Control to OR-Control by Program Transformation]''. [https://www.elsevier.com/books/foundations-of-deductive-databases-and-logic-programming/minker/978-0-934613-40-8 Foundations of Deductive Databases and Logic Programming], [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan Kaufmann]
 
* [[Maarten van Emden]], [https://dblp.uni-trier.de/pers/hd/s/Szeredi:P=eacute=ter Péter Szeredi] ('''1988'''). ''[https://www.sciencedirect.com/science/article/pii/B9780934613408500221 Converting AND-Control to OR-Control by Program Transformation]''. [https://www.elsevier.com/books/foundations-of-deductive-databases-and-logic-programming/minker/978-0-934613-40-8 Foundations of Deductive Databases and Logic Programming], [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan Kaufmann]
 
==1990 ...==
 
==1990 ...==
* [https://dblp.uni-trier.de/pers/hd/c/Cheng:Mantis_H=_M= Mantis H. M. Cheng], [[Maarten van Emden]], [https://dblp.uni-trier.de/pers/hd/r/Richards:B=_E= B. E. Richards] ('''1990'''). ''On Warren's Method for Functional Programming in Logic''. [https://dblp.uni-trier.de/db/conf/iclp/iclp90.html ICLP 1990] <ref>[https://en.wikipedia.org/wiki/David_H._D._Warren David H. D. Warren] ('''1982'''). ''Higer-order extensions to prolog: are they needed?'' [https://aitopics.org/download/classics:C65CF540 pdf]</ref>
+
* [https://dblp.uni-trier.de/pers/hd/c/Cheng:Mantis_H=_M= Mantis H. M. Cheng], [[Maarten van Emden]], [https://dblp.uni-trier.de/pers/hd/r/Richards:B=_E= B. E. Richards] ('''1990'''). ''On Warren's Method for Functional Programming in Logic''. [https://dblp.uni-trier.de/db/conf/iclp/iclp90.html ICLP 1990] <ref>[[Mathematician#DHDWarren|David H. D. Warren]] ('''1982'''). ''Higer-order extensions to prolog: are they needed?'' [https://aitopics.org/download/classics:C65CF540 pdf]</ref>
 
* [[Maarten van Emden]] ('''1992'''). ''Rhetoric versus Modernism in Computing''. [https://en.wikipedia.org/wiki/Journal_of_Logic_and_Computation Journal of Logic and Computation], Vol. 2  
 
* [[Maarten van Emden]] ('''1992'''). ''Rhetoric versus Modernism in Computing''. [https://en.wikipedia.org/wiki/Journal_of_Logic_and_Computation Journal of Logic and Computation], Vol. 2  
 
* [[Maarten van Emden]] ('''1992'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1002/stvr.4370020304 Structured Inspections of Code]''. [https://dblp.uni-trier.de/db/journals/stvr/stvr2.html Software Testing, Verification & Reliability, Vol. 2]
 
* [[Maarten van Emden]] ('''1992'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1002/stvr.4370020304 Structured Inspections of Code]''. [https://dblp.uni-trier.de/db/journals/stvr/stvr2.html Software Testing, Verification & Reliability, Vol. 2]

Latest revision as of 17:56, 16 November 2020

Home * People * Maarten van Emden

Maarten van Emden [1]

Maarten H. van Emden,
a Dutch mathematician, electrical engineer and computer scientist. He defended his Ph.D. thesis in Information theory and Data analysis in 1971 at University of Amsterdam under Adriaan van Wijngaarden. He held research positions at the IBM T.J. Watson Laboratory and the University of Edinburgh, before he went to Canada to teach and research in programming at University of Waterloo and University of Victoria. Maarten van Emden is proponent of the declarative logical and constraint programming language Prolog. He wrote an advice-taking Prolog program for certain chess endgames [2]. Along with Robert Kowalski, Van Emden developed the fixpoint semantics of Horn clauses, which underpin the logical semantics of logic programming [3] [4]. He further researched on software verification and correctness, and constraint satisfaction, along with interval arithmetic and interval propagation.

Quotes

Maarten van Emden

From I remember Donald Michie [5]:

To accommodate a driven student with his own project requires a supervisor who is not one of those lowly beavers. In the case of Schaeffer it was Morven Gentleman. When Gentleman left, the nearly finished Schaeffer was transferred to Randy Goebel and myself. As a result, he is, pro forma, my most famous student. ...
Donald Michie demonstrated the Human Window phenomenon with chess end games. He proposed a form of describing end-game knowledge that he called “advice” and described a formal language, Advice Language One [6] , for expressing such advice. The language could be translated into a form that guided a computer to play the end-game at the level of skill of a chess expert. Soei Tan, Ivan Bratko and Danny Kopec were chess experts who used this framework to implement specific end games.
Once again, I did not get it. I could not help acting in my then usual role of Prolog evangelist and wanted to demonstrate that the beauty of Prolog was that it rendered superfluous things like Advice Language One. Accordingly I wrote a Prolog program that played an end game using Advice in DM’s sense [7]. DM generously allowed me my say in a paper in the Tenth Machine Intelligence workshop. It’s a nice paper, but it does not get it. 

Alejandro López-Ortiz

From An Introduction to Computer Chess [8] :

From the team of undergrads who authored Ribbit, Ron Hansen went on to write his master thesis on computer chess, and eventually Prof. Van Emden became an expert in computer chess and endgames. 

Selected Publications

[9] [10] [11] [12]

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level