Difference between revisions of "James R. Slagle"

From Chessprogramming wiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 4: Line 4:
  
 
'''James Robert Slagle''', (born March 1, 1934)<br/>
 
'''James Robert Slagle''', (born March 1, 1934)<br/>
−
an American mathematician, computer scientist, and since 1984 Distinguished Professor of Computer Science at the [https://en.wikipedia.org/wiki/University_of_Minnesota University of Minnesota], [https://en.wikipedia.org/wiki/Minneapolis Minneapolis], with former appointments at [https://en.wikipedia.org/wiki/Johns_Hopkins_University Johns Hopkins University], [https://en.wikipedia.org/wiki/National_Institutes_of_Health National Institutes of Health], [https://en.wikipedia.org/wiki/Bethesda,_Maryland Bethesda, Maryland], [https://en.wikipedia.org/wiki/Naval_Research_Laboratory Naval Research Laboratory], [[Lawrence Livermore National Laboratory|Lawrence Radiation Laboratory]], [https://en.wikipedia.org/wiki/University_of_California University of California] and [[Massachusetts Institute of Technology]]. As [https://en.wikipedia.org/wiki/Freshman Freshman] [https://en.wikipedia.org/wiki/Calculus Calculus] Student and Ph.D. candidate at MIT, supervised by [[Marvin Minsky]] <ref>[http://web.media.mit.edu/~minsky/people.html Personal page for Marvin Minsky]</ref> in 1961, he wrote his dissertation entitled ''Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint)'' <ref>[https://www.genealogy.math.ndsu.nodak.edu/id.php?id=41537 The Mathematics Genealogy Project - James Robert Slagle]</ref>, which is acknowledged as first [https://en.wikipedia.org/wiki/Expert_system Expert system] <ref>[http://what-when-how.com/inventions/saint-inventions/ SAINT (Inventions) - what-when-how] (states James R. Slagle died in 1994)</ref>. His further research interests covers [https://en.wikipedia.org/wiki/Heuristic heuristic] [https://en.wikipedia.org/wiki/Automated_theorem_proving Theorem-Proving] and as application heuristic [[Search|search]].  
+
an American mathematician, computer scientist, and since 1984 Distinguished Professor of Computer Science at the [[University of Minnesota]], [https://en.wikipedia.org/wiki/Minneapolis Minneapolis], with former appointments at [https://en.wikipedia.org/wiki/Johns_Hopkins_University Johns Hopkins University], [https://en.wikipedia.org/wiki/National_Institutes_of_Health National Institutes of Health], [https://en.wikipedia.org/wiki/Bethesda,_Maryland Bethesda, Maryland], [https://en.wikipedia.org/wiki/Naval_Research_Laboratory Naval Research Laboratory], [[Lawrence Livermore National Laboratory|Lawrence Radiation Laboratory]], [https://en.wikipedia.org/wiki/University_of_California University of California] and [[Massachusetts Institute of Technology]]. As [https://en.wikipedia.org/wiki/Freshman Freshman] [https://en.wikipedia.org/wiki/Calculus Calculus] Student and Ph.D. candidate at MIT, supervised by [[Marvin Minsky]] <ref>[http://web.media.mit.edu/~minsky/people.html Personal page for Marvin Minsky]</ref> in 1961, he wrote his dissertation entitled ''Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint)'' <ref>[https://www.genealogy.math.ndsu.nodak.edu/id.php?id=41537 The Mathematics Genealogy Project - James Robert Slagle]</ref>, which is acknowledged as first [https://en.wikipedia.org/wiki/Expert_system Expert system] <ref>[http://what-when-how.com/inventions/saint-inventions/ SAINT (Inventions) - what-when-how] (states James R. Slagle died in 1994)</ref>. His further research interests covers [https://en.wikipedia.org/wiki/Heuristic heuristic] [https://en.wikipedia.org/wiki/Automated_theorem_proving Theorem-Proving] and as application heuristic [[Search|search]].  
  
 
President [https://en.wikipedia.org/wiki/Dwight_D._Eisenhower Dwight D. Eisenhower], in 1959, presented him with five hundred dollars, awarded by Recording for the [http://www.blindinc.org/ Blind Inc.], for outstanding work as a blind student <ref>[http://www.time.com/time/magazine/article/0,9171,811144,00.html Education: Their Best], [https://en.wikipedia.org/wiki/Time_%28magazine%29 Time], June 01, 1959</ref>.  
 
President [https://en.wikipedia.org/wiki/Dwight_D._Eisenhower Dwight D. Eisenhower], in 1959, presented him with five hundred dollars, awarded by Recording for the [http://www.blindinc.org/ Blind Inc.], for outstanding work as a blind student <ref>[http://www.time.com/time/magazine/article/0,9171,811144,00.html Education: Their Best], [https://en.wikipedia.org/wiki/Time_%28magazine%29 Time], June 01, 1959</ref>.  
Line 13: Line 13:
 
<span id="TheoremProving"></span>
 
<span id="TheoremProving"></span>
 
=Theorem-Proving=
 
=Theorem-Proving=
−
Abstract of ''Experiments With a Multipurpose, Theorem-Proving Heuristic Program''. <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[http://portal.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref> from the [[ACM#Portal|ACM Portal]]:
+
Abstract of ''Experiments With a Multipurpose, Theorem-Proving Heuristic Program''. <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1 </ref>:
 
  The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied. As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about [[Kalah]] end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of Kalah. This program was compared with another tree-searching procedure, the [[Alpha-Beta]] minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.   
 
  The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied. As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about [[Kalah]] end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of Kalah. This program was compared with another tree-searching procedure, the [[Alpha-Beta]] minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.   
 
<span id="MNprocedure"></span>
 
<span id="MNprocedure"></span>
 
=M & N procedure=
 
=M & N procedure=
−
Abstract of ''Experiments with the M & N Tree-Searching Program'' <ref>[[James R. Slagle]], [[John K. Dixon]] ('''1970'''). ''[http://portal.acm.org/citation.cfm?id=362052.362054 Experiments with the M & N Tree-Searching Program]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 3</ref> from the [[ACM#Portal|ACM Portal]]:
+
Abstract of ''Experiments with the M & N Tree-Searching Program'' <ref>[[James R. Slagle]], [[John K. Dixon]] ('''1970'''). ''[http://portal.acm.org/citation.cfm?id=362052.362054 Experiments with the M & N Tree-Searching Program]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 3</ref>:
 
  The M & N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M & N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M & N procedure was written in LISP to play the game of Kalah, and it was demonstrated that the M & N procedure is significantly superior to the mini-max procedure. The statistical significance of important conclusions is given. Since information on statistical significance has often been lacking in papers on computer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.  
 
  The M & N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M & N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M & N procedure was written in LISP to play the game of Kalah, and it was demonstrated that the M & N procedure is significantly superior to the mini-max procedure. The statistical significance of important conclusions is given. Since information on statistical significance has often been lacking in papers on computer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.  
  
 
=Selected Publications=  
 
=Selected Publications=  
−
<ref>[http://projects.csail.mit.edu/jacm/Authors/slaglejamesr.html JACM Authors - James R. Slagle]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/s/Slagle:James_R= dblp: James R. Slagle]</ref> <ref>[http://www.cs.berkeley.edu/~russell/aima1e/aima-bib.html Bibliography for Artificial Intelligence: A Modern Approach]</ref>
+
<ref>[http://projects.csail.mit.edu/jacm/Authors/slaglejamesr.html JACM Authors - James R. Slagle]</ref> <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/s/Slagle:James_R= dblp: James R. Slagle]</ref> <ref>[http://www.cs.berkeley.edu/~russell/aima1e/aima-bib.html Bibliography for Artificial Intelligence: A Modern Approach]</ref>
 
==1959==
 
==1959==
 
* [[James R. Slagle]] ('''1959'''). ''[http://portal.acm.org/citation.cfm?id=612201.612245&coll=DL&dl=GUIDE&CFID=27386242&CFTOKEN=68454346 Formal integration on a digital computer]''. 14th national meeting of the Association for Computing Machinery
 
* [[James R. Slagle]] ('''1959'''). ''[http://portal.acm.org/citation.cfm?id=612201.612245&coll=DL&dl=GUIDE&CFID=27386242&CFTOKEN=68454346 Formal integration on a digital computer]''. 14th national meeting of the Association for Computing Machinery
Line 33: Line 33:
 
* [[James R. Slagle]] ('''1965'''). ''Experiments with a deductive question-answering program''. [[ACM#Communications|Communications of the ACM]], Vol. 8, No. 12
 
* [[James R. Slagle]] ('''1965'''). ''Experiments with a deductive question-answering program''. [[ACM#Communications|Communications of the ACM]], Vol. 8, No. 12
 
* [[James R. Slagle]] ('''1967'''). ''Automatic Theorem Proving With Renamable and Semantic Resolution''. [[ACM#Journal|Journal of the ACM]], Vol. 14, No. 4
 
* [[James R. Slagle]] ('''1967'''). ''Automatic Theorem Proving With Renamable and Semantic Resolution''. [[ACM#Journal|Journal of the ACM]], Vol. 14, No. 4
−
* [[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[http://portal.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1 <ref>[http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.jsl/1183737432 Cooper: Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program]</ref>
+
* [[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1 <ref>[https://www.projecteuclid.org/euclid.jsl/1183735759 David C. Cooper] ('''1970'''). ''[https://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.jsl/1183737432 Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program]''. [https://en.wikipedia.org/wiki/Journal_of_Symbolic_Logic Journal of Symbolic Logic], Vol. 35, No. 4</ref>:
 
* [[James R. Slagle]], [[John K. Dixon]] ('''1969'''). ''[http://portal.acm.org/citation.cfm?id=321510.321511 Experiments With Some Programs That Search Game Trees]''. [[ACM#Journal|Journal of the ACM]], Vol. 16, No. 2, [http://wiki.cs.pdx.edu/cs542-spring2011/nfp/abmin.pdf pdf], [http://wiki.cs.pdx.edu/wurzburg2009/nfp/abmin.pdf pdf]
 
* [[James R. Slagle]], [[John K. Dixon]] ('''1969'''). ''[http://portal.acm.org/citation.cfm?id=321510.321511 Experiments With Some Programs That Search Game Trees]''. [[ACM#Journal|Journal of the ACM]], Vol. 16, No. 2, [http://wiki.cs.pdx.edu/cs542-spring2011/nfp/abmin.pdf pdf], [http://wiki.cs.pdx.edu/wurzburg2009/nfp/abmin.pdf pdf]
 
* [[James R. Slagle]], [[Chin-Liang Chang]], [[Richard C. T. Lee]] ('''1969'''). ''Completeness Theorems for Semantic Resolution In Consequence-Finding''. [[Conferences#IJCAI|IJCAI-69]], [http://ijcai.org/Past%20Proceedings/IJCAI-69/PDF/028.pdf pdf]
 
* [[James R. Slagle]], [[Chin-Liang Chang]], [[Richard C. T. Lee]] ('''1969'''). ''Completeness Theorems for Semantic Resolution In Consequence-Finding''. [[Conferences#IJCAI|IJCAI-69]], [http://ijcai.org/Past%20Proceedings/IJCAI-69/PDF/028.pdf pdf]
Line 55: Line 55:
 
==2000 ...==
 
==2000 ...==
 
* [http://www.cs.ou.edu/~hougen/ Dean F. Hougen], [http://www-users.cs.umn.edu/~gini/ Maria Gini], [[James R. Slagle]] ('''2000'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.2633 An Integrated Connectionist Approach to Reinforcement Learning for Robotic Control]''. ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
 
* [http://www.cs.ou.edu/~hougen/ Dean F. Hougen], [http://www-users.cs.umn.edu/~gini/ Maria Gini], [[James R. Slagle]] ('''2000'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.2633 An Integrated Connectionist Approach to Reinforcement Learning for Robotic Control]''. ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
 +
* [https://en.wikipedia.org/wiki/Pamela_McCorduck Pamela McCorduck] ('''2004'''). ''[[Artificial Intelligence#MachinesWhoThink|Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence]]''. [https://en.wikipedia.org/wiki/A_K_Peters A. K. Peters] (25th anniversary edition)
  
 
=External Links=  
 
=External Links=  

Latest revision as of 17:10, 16 November 2020

Home * People * James R. Slagle

James R. Slagle [1]

James Robert Slagle, (born March 1, 1934)
an American mathematician, computer scientist, and since 1984 Distinguished Professor of Computer Science at the University of Minnesota, Minneapolis, with former appointments at Johns Hopkins University, National Institutes of Health, Bethesda, Maryland, Naval Research Laboratory, Lawrence Radiation Laboratory, University of California and Massachusetts Institute of Technology. As Freshman Calculus Student and Ph.D. candidate at MIT, supervised by Marvin Minsky [2] in 1961, he wrote his dissertation entitled Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint) [3], which is acknowledged as first Expert system [4]. His further research interests covers heuristic Theorem-Proving and as application heuristic search.

President Dwight D. Eisenhower, in 1959, presented him with five hundred dollars, awarded by Recording for the Blind Inc., for outstanding work as a blind student [5].

Saint

Quote by Marvin Minsky on Slagle's Symbolic Automatic Integrator, discussing his book The Emotion Machine [6] [7]: 

Why don't we have artificial intelligence yet? There were some remarkable achievements in very early days of artificial intelligence. This is my favorite one, a young student who happened to be blind named James Slagle wrote a Ph.D. thesis in 1961 that was nearly as good as a good MIT freshman at doing intergroup calculus. Up until then there was no general theory of how to integrate functions. Isaac Newton invented the process but could not solve it. People like Gauss and others spent the next couple of centuries on it. By 1950, there was a great collection called the Bateman Manuscript Project run by the American Mathematical Society and they collected integrals.

Theorem-Proving

Abstract of Experiments With a Multipurpose, Theorem-Proving Heuristic Program. [8]: 

The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied. As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about Kalah end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of Kalah. This program was compared with another tree-searching procedure, the Alpha-Beta minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.

M & N procedure

Abstract of Experiments with the M & N Tree-Searching Program [9]: 

The M & N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M & N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M & N procedure was written in LISP to play the game of Kalah, and it was demonstrated that the M & N procedure is significantly superior to the mini-max procedure. The statistical significance of important conclusions is given. Since information on statistical significance has often been lacking in papers on computer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.

Selected Publications

[10] [11] [12] [13]

1959

1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

External Links

References

  1. ↑ Jet, January 22, 1970, pp 21
  2. ↑ Personal page for Marvin Minsky
  3. ↑ The Mathematics Genealogy Project - James Robert Slagle
  4. ↑ SAINT (Inventions) - what-when-how (states James R. Slagle died in 1994)
  5. ↑ Education: Their Best, Time, June 01, 1959
  6. ↑ Terasem Journal of Personal Cyberconsciousness - Marvin Lee Minsky discussing his book, The Emotion Machine
  7. ↑ Marvin Minsky's Home Page
  8. ↑ James R. Slagle, Philip Bursky (1968). Experiments With a Multipurpose, Theorem-Proving Heuristic Program. Journal of the ACM, Vol. 15, No. 1
  9. ↑ James R. Slagle, John K. Dixon (1970). Experiments with the M & N Tree-Searching Program. Communications of the ACM, Vol. 13, No. 3
  10. ↑ JACM Authors - James R. Slagle
  11. ↑ ICGA Reference Database
  12. ↑ dblp: James R. Slagle
  13. ↑ Bibliography for Artificial Intelligence: A Modern Approach
  14. ↑ David C. Cooper (1970). Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program. Journal of Symbolic Logic, Vol. 35, No. 4

Up one level

Retrieved from "https://www.chessprogramming.org/index.php?title=James_R._Slagle&oldid=22300"