25,161
edits
Changes
no edit summary
<span id="TheoremProving"></span>
=Theorem-Proving=
Abstract of ''Experiments With a Multipurpose, Theorem-Proving Heuristic Program''. <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[httphttps://portaldl.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.
* [[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'''). ''[httphttps://portaldl.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>[httphttps://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 Cooper: 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]], [[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]
