25,161
edits
Changes
Created page with "'''Home * People * James R. Slagle''' [[FILE:Slagle.JPG|border|right|thumb|James R. Slagle <ref>[https://en.wikipedia.org/wiki/Jet_%28magazine%29 Jet], [htt..."
'''[[Main Page|Home]] * [[People]] * James R. Slagle'''
[[FILE:Slagle.JPG|border|right|thumb|James R. Slagle <ref>[https://en.wikipedia.org/wiki/Jet_%28magazine%29 Jet], [http://books.google.com/books/about/Jet.html?id=JjkDAAAAMBAJ January 22, 1970], pp 21</ref> ]]
'''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]].
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>.
=Saint=
Quote by [[Marvin Minsky]] on Slagle's '''''S'''ymbolic '''A'''utomatic '''Int'''egrator'', discussing his book ''[https://en.wikipedia.org/wiki/The_Emotion_Machine The Emotion Machine]'' <ref>[http://www.terasemjournals.org/PCJournal/PC0303/mm1.html Terasem Journal of Personal Cyberconsciousness - Marvin Lee Minsky discussing his book, The Emotion Machine] </ref> <ref>[http://web.media.mit.edu/~minsky/ Marvin Minsky's Home Page]</ref>:
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 [https://en.wikipedia.org/wiki/Integral integrate functions]. [[Mathematician#IsaacNewton|Isaac Newton]] invented the process but could not solve it. People like [[Mathematician#Gauss|Gauss]] and others spent the next couple of centuries on it. By 1950, there was a great collection called the [https://en.wikipedia.org/wiki/Bateman_Manuscript_Project Bateman Manuscript Project] run by the [https://en.wikipedia.org/wiki/American_Mathematical_Society American Mathematical Society] and they collected integrals.
<span id="TheoremProving"></span>
=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]]:
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>
=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]]:
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=
<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>
==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
==1960 ...==
* [[James R. Slagle]] ('''1961'''). ''A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint)''. [http://dspace.mit.edu/bitstream/handle/1721.1/11997/31225400.pdf pdf]
* [[James R. Slagle]] ('''1963'''). ''A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus''. [[ACM#Journal|Journal of the ACM]], Vol. 10, No. 4
* [[James R. Slagle]] ('''1963'''). ''Game Trees, M & N Minimaxing, and the M & N alpha-beta procedure.'' Artificial Intelligence Group Report 3, UCRL-4671, University of California
* [[James R. Slagle]] ('''1964'''). ''An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions''. [[ACM#Journal|Journal of the ACM]], Vol. 11, No. 3
* [[James R. Slagle]] ('''1964'''). ''On an algorithm for minimum-cost procedures''. [[ACM#Communications|Communications of the ACM]], Vol. 7, No. 11
* [[James R. Slagle]] ('''1965'''). ''A multipurpose Theorem Proving Heuristic Program that learns''. [http://www.bibliopolis.com/main/books/caliban_0032271.html IFIP Congress 65, Vol. 2]
* [[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]], [[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]], [[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]
==1970 ...==
* [[James R. Slagle]], [[Chin-Liang Chang]], [[Richard C. T. Lee]] ('''1970'''). ''[http://portal.acm.org/citation.cfm?id=1310139.1310332&coll=DL&dl=GUIDE&CFID=27479742&CFTOKEN=16394760 A New Algorithm for Generating Prime Implicants]''. [https://en.wikipedia.org/wiki/IEEE_Transactions_on_Computers IEEE Transactions on Computers], Vol. 19, No. 4
* [[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
* [[James R. Slagle]] ('''1971''').'' Artificial Intelligence: The Heuristic Programming Approach''. McGraw-Hill, New York. [http://www.amazon.com/gp/customer-media/product-gallery/0070580057/ref=cm_ciu_pdp_images_all amazon]
* [[James R. Slagle]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/f/Farrell:Carl_D=.html Carl D. Farell] ('''1971'''). ''[http://portal.acm.org/citation.cfm?id=362515.362560 Experiments in automatic learning for a multipurpose hueristic program]''. [[ACM#Communications|Communications of the ACM]], Vol. 14, No. 2
* [[James R. Slagle]], [[Richard C. T. Lee]] ('''1971'''). ''[http://portal.acm.org/citation.cfm?id=362515.362562 Application of game tree searching techniques to sequential pattern recognition]''. [[ACM#Communications|Communications of the ACM]], Vol. 14, No. 2
* [[Chin-Liang Chang]], [[James R. Slagle]] ('''1979'''). ''[http://www.sciencedirect.com/science/article/pii/0004370279900158 Using Rewriting Rules for Connection Graphs to Prove Theorems]''. [[Artificial Intelligence#Journals|Artificial Intelligence]]
==1980 ...==
* [[James R. Slagle]], [[John K. Dixon]] ('''1980'''). ''[http://www.sciencedirect.com/science/article/pii/0031320380900308 Finding a good figure that approximately passes through given points]''. Pattern Recognition, 1980
* [[John K. Dixon]], [http://www.law.sc.edu/faculty/johnson/ Herbert A. Johnson], [[James R. Slagle]] ('''1980'''). ''[http://onlinelibrary.wiley.com/doi/10.1111/j.1559-3584.1980.tb03926.x/abstract The Prospect of an Under Water Naval Robot]''. [http://onlinelibrary.wiley.com/doi/10.1111/nej.1980.92.issue-1/issuetoc Naval Engineers Journal, Vol. 92, No. 1]
* [[John K. Dixon]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Bouchard:Susan_A=.html Susan A. Bouchard], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Kennedy:William_G=.html William G. Kennedy], [[James R. Slagle]] ('''1981'''). ''[http://portal.acm.org/citation.cfm?id=1623264.1623365 MARK I Robot]''. [[Conferences#IJCAI|IJCAI'1981]], [http://ijcai.org/Past%20Proceedings/IJCAI-81-VOL-2/PDF/101.pdf pdf]
* [[James R. Slagle]], [[John K. Dixon]] ('''1984'''). ''[http://www.sciencedirect.com/science/article/pii/0031320384900165 Freedom descriptions: A way to find figures that approximate given points]''. Pattern Recognition, 1984
* [http://cs.gmu.edu/~henryh/ Henry Hamburger], [[James R. Slagle]] ('''1986'''). ''[http://onlinelibrary.wiley.com/doi/10.1002/nav.3800330204/abstract Heterogeneous discrete expenditure for diminishing returns]''. [http://onlinelibrary.wiley.com/doi/10.1002/nav.v33:2/issuetoc Naval Research Logistics Quarterly, Vol. 33, No. 2]
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/i/Irani:E=_A=.html Erach A. Irani], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Matts:John_P=.html John P. Matts], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Long:John_M=.html John M. Long], [[James R. Slagle]], POSCH group ('''1989'''). ''Using Artificial Neural Nets for Statistical Discovery: Observations after Using Backpropogation, Expert Systems, and Multiple-Linear Regression on Clinical Trial Data''. University of Minnesota, Minneapolis, MN 55455, USA, Complex Systems 3, [http://www.complex-systems.com/pdf/03-3-5.pdf pdf]
==1990 ...==
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/i/Irani:E=_A=.html Erach A. Irani], [[James R. Slagle]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Long:John_M=.html John M. Long], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Matts:John_P=.html John P. Matts] ('''1990'''). ''[http://www.springerlink.com/content/tj1054x2t33r41u5/ Formulating an approach to develop a system for the temporal analysis of clinical trial data: The POSCH AI project]''. [http://www.springerlink.com/content/1012-2443/ Annals of Mathematics and Artificial Intelligence, Volume 2, Numbers 1-4]
* [[James R. Slagle]], [http://wiki.tcl.tk/13 Zbigniew Wieckowski] a.k.a. Bishak ('''1994'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.2996 Ideas for Intelligent User Interface Design]''.
==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
=External Links=
* [https://en.wikipedia.org/wiki/James_Robert_Slagle James Robert Slagle from Wikipedia]
* [http://prabook.com/web/person-view.html?profileId=1659451 James Robert Slagle (born 1934), American computer science educator | Prabook]
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=41537 The Mathematics Genealogy Project - James Robert Slagle]
* [http://www.americanblindchess.org/potb.htm Winners of Past Over-The-Board Tournaments], [http://www.americanblindchess.org/ United States Braille Chess Association]
* [http://news.google.com/newspapers?nid=1298&dat=19710201&id=2QsUAAAAIBAJ&sjid=W4oDAAAAIBAJ&pg=5449,3121890 Slagle, who is blind, received the Class A trophy], [https://en.wikipedia.org/wiki/The_Free_Lance%E2%80%93Star The Free Lance-Star] February 01, 1971, from [http://news.google.com/nwshp Google news]
* [http://www.aaai.org/Awards/fellows-list.php Elected AAAI Fellows]
* [http://www.elsevier.com/wps/find/journaleditorialboard.cws_home/939/editorialboard Expert Systems with Applications - Editorial Board], [http://www.elsevierscitech.com/cfp/cfp_eswa0411.pdf pdf]
=References=
<references />
'''[[Engines|Up one level]]'''
[[FILE:Slagle.JPG|border|right|thumb|James R. Slagle <ref>[https://en.wikipedia.org/wiki/Jet_%28magazine%29 Jet], [http://books.google.com/books/about/Jet.html?id=JjkDAAAAMBAJ January 22, 1970], pp 21</ref> ]]
'''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]].
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>.
=Saint=
Quote by [[Marvin Minsky]] on Slagle's '''''S'''ymbolic '''A'''utomatic '''Int'''egrator'', discussing his book ''[https://en.wikipedia.org/wiki/The_Emotion_Machine The Emotion Machine]'' <ref>[http://www.terasemjournals.org/PCJournal/PC0303/mm1.html Terasem Journal of Personal Cyberconsciousness - Marvin Lee Minsky discussing his book, The Emotion Machine] </ref> <ref>[http://web.media.mit.edu/~minsky/ Marvin Minsky's Home Page]</ref>:
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 [https://en.wikipedia.org/wiki/Integral integrate functions]. [[Mathematician#IsaacNewton|Isaac Newton]] invented the process but could not solve it. People like [[Mathematician#Gauss|Gauss]] and others spent the next couple of centuries on it. By 1950, there was a great collection called the [https://en.wikipedia.org/wiki/Bateman_Manuscript_Project Bateman Manuscript Project] run by the [https://en.wikipedia.org/wiki/American_Mathematical_Society American Mathematical Society] and they collected integrals.
<span id="TheoremProving"></span>
=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]]:
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>
=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]]:
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=
<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>
==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
==1960 ...==
* [[James R. Slagle]] ('''1961'''). ''A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint)''. [http://dspace.mit.edu/bitstream/handle/1721.1/11997/31225400.pdf pdf]
* [[James R. Slagle]] ('''1963'''). ''A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus''. [[ACM#Journal|Journal of the ACM]], Vol. 10, No. 4
* [[James R. Slagle]] ('''1963'''). ''Game Trees, M & N Minimaxing, and the M & N alpha-beta procedure.'' Artificial Intelligence Group Report 3, UCRL-4671, University of California
* [[James R. Slagle]] ('''1964'''). ''An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions''. [[ACM#Journal|Journal of the ACM]], Vol. 11, No. 3
* [[James R. Slagle]] ('''1964'''). ''On an algorithm for minimum-cost procedures''. [[ACM#Communications|Communications of the ACM]], Vol. 7, No. 11
* [[James R. Slagle]] ('''1965'''). ''A multipurpose Theorem Proving Heuristic Program that learns''. [http://www.bibliopolis.com/main/books/caliban_0032271.html IFIP Congress 65, Vol. 2]
* [[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]], [[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]], [[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]
==1970 ...==
* [[James R. Slagle]], [[Chin-Liang Chang]], [[Richard C. T. Lee]] ('''1970'''). ''[http://portal.acm.org/citation.cfm?id=1310139.1310332&coll=DL&dl=GUIDE&CFID=27479742&CFTOKEN=16394760 A New Algorithm for Generating Prime Implicants]''. [https://en.wikipedia.org/wiki/IEEE_Transactions_on_Computers IEEE Transactions on Computers], Vol. 19, No. 4
* [[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
* [[James R. Slagle]] ('''1971''').'' Artificial Intelligence: The Heuristic Programming Approach''. McGraw-Hill, New York. [http://www.amazon.com/gp/customer-media/product-gallery/0070580057/ref=cm_ciu_pdp_images_all amazon]
* [[James R. Slagle]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/f/Farrell:Carl_D=.html Carl D. Farell] ('''1971'''). ''[http://portal.acm.org/citation.cfm?id=362515.362560 Experiments in automatic learning for a multipurpose hueristic program]''. [[ACM#Communications|Communications of the ACM]], Vol. 14, No. 2
* [[James R. Slagle]], [[Richard C. T. Lee]] ('''1971'''). ''[http://portal.acm.org/citation.cfm?id=362515.362562 Application of game tree searching techniques to sequential pattern recognition]''. [[ACM#Communications|Communications of the ACM]], Vol. 14, No. 2
* [[Chin-Liang Chang]], [[James R. Slagle]] ('''1979'''). ''[http://www.sciencedirect.com/science/article/pii/0004370279900158 Using Rewriting Rules for Connection Graphs to Prove Theorems]''. [[Artificial Intelligence#Journals|Artificial Intelligence]]
==1980 ...==
* [[James R. Slagle]], [[John K. Dixon]] ('''1980'''). ''[http://www.sciencedirect.com/science/article/pii/0031320380900308 Finding a good figure that approximately passes through given points]''. Pattern Recognition, 1980
* [[John K. Dixon]], [http://www.law.sc.edu/faculty/johnson/ Herbert A. Johnson], [[James R. Slagle]] ('''1980'''). ''[http://onlinelibrary.wiley.com/doi/10.1111/j.1559-3584.1980.tb03926.x/abstract The Prospect of an Under Water Naval Robot]''. [http://onlinelibrary.wiley.com/doi/10.1111/nej.1980.92.issue-1/issuetoc Naval Engineers Journal, Vol. 92, No. 1]
* [[John K. Dixon]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Bouchard:Susan_A=.html Susan A. Bouchard], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Kennedy:William_G=.html William G. Kennedy], [[James R. Slagle]] ('''1981'''). ''[http://portal.acm.org/citation.cfm?id=1623264.1623365 MARK I Robot]''. [[Conferences#IJCAI|IJCAI'1981]], [http://ijcai.org/Past%20Proceedings/IJCAI-81-VOL-2/PDF/101.pdf pdf]
* [[James R. Slagle]], [[John K. Dixon]] ('''1984'''). ''[http://www.sciencedirect.com/science/article/pii/0031320384900165 Freedom descriptions: A way to find figures that approximate given points]''. Pattern Recognition, 1984
* [http://cs.gmu.edu/~henryh/ Henry Hamburger], [[James R. Slagle]] ('''1986'''). ''[http://onlinelibrary.wiley.com/doi/10.1002/nav.3800330204/abstract Heterogeneous discrete expenditure for diminishing returns]''. [http://onlinelibrary.wiley.com/doi/10.1002/nav.v33:2/issuetoc Naval Research Logistics Quarterly, Vol. 33, No. 2]
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/i/Irani:E=_A=.html Erach A. Irani], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Matts:John_P=.html John P. Matts], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Long:John_M=.html John M. Long], [[James R. Slagle]], POSCH group ('''1989'''). ''Using Artificial Neural Nets for Statistical Discovery: Observations after Using Backpropogation, Expert Systems, and Multiple-Linear Regression on Clinical Trial Data''. University of Minnesota, Minneapolis, MN 55455, USA, Complex Systems 3, [http://www.complex-systems.com/pdf/03-3-5.pdf pdf]
==1990 ...==
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/i/Irani:E=_A=.html Erach A. Irani], [[James R. Slagle]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Long:John_M=.html John M. Long], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Matts:John_P=.html John P. Matts] ('''1990'''). ''[http://www.springerlink.com/content/tj1054x2t33r41u5/ Formulating an approach to develop a system for the temporal analysis of clinical trial data: The POSCH AI project]''. [http://www.springerlink.com/content/1012-2443/ Annals of Mathematics and Artificial Intelligence, Volume 2, Numbers 1-4]
* [[James R. Slagle]], [http://wiki.tcl.tk/13 Zbigniew Wieckowski] a.k.a. Bishak ('''1994'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.2996 Ideas for Intelligent User Interface Design]''.
==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
=External Links=
* [https://en.wikipedia.org/wiki/James_Robert_Slagle James Robert Slagle from Wikipedia]
* [http://prabook.com/web/person-view.html?profileId=1659451 James Robert Slagle (born 1934), American computer science educator | Prabook]
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=41537 The Mathematics Genealogy Project - James Robert Slagle]
* [http://www.americanblindchess.org/potb.htm Winners of Past Over-The-Board Tournaments], [http://www.americanblindchess.org/ United States Braille Chess Association]
* [http://news.google.com/newspapers?nid=1298&dat=19710201&id=2QsUAAAAIBAJ&sjid=W4oDAAAAIBAJ&pg=5449,3121890 Slagle, who is blind, received the Class A trophy], [https://en.wikipedia.org/wiki/The_Free_Lance%E2%80%93Star The Free Lance-Star] February 01, 1971, from [http://news.google.com/nwshp Google news]
* [http://www.aaai.org/Awards/fellows-list.php Elected AAAI Fellows]
* [http://www.elsevier.com/wps/find/journaleditorialboard.cws_home/939/editorialboard Expert Systems with Applications - Editorial Board], [http://www.elsevierscitech.com/cfp/cfp_eswa0411.pdf pdf]
=References=
<references />
'''[[Engines|Up one level]]'''
