• Publications
  • Influence
A New Algorithm for Generating Prime Implicants
TLDR
This paper describes an algorithm which will generate all the prime implicants of a Boolean function. Expand
  • 162
  • 4
A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
  • J. Slagle
  • Mathematics, Computer Science
  • JACM
  • 1 October 1963
TLDR
A large high-speed general-purpose digital computer (IBM 7090) was programmed to solve elementary symbolic integration problems at approximately the level of a good college freshman. Expand
  • 178
  • 4
  • PDF
Automatic Theorem Proving With Renamable and Semantic Resolution
  • J. Slagle
  • Mathematics, Computer Science
  • JACM
  • 1 October 1967
TLDR
The theory of J. A Robinson's resolution principle, an inference rule for first-order predicate calculus, is unified and extended. Expand
  • 185
  • 3
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
TLDR
A method for the sequential mapping of points in a high-dimensional space onto a plane is presented. Expand
  • 160
  • 2
Experiments With Some Programs That Search Game Trees
TLDR
A new method called “dynamic ordering” is described, and the older minimax and Alpha-Beta procedures are described for comparison purposes. Expand
  • 130
  • 2
  • PDF
An Admissible and Optimal Algorithm for Searching AND/OR Graphs
TLDR
An algorithm for searching for minimal solution graph in an AND/OR graph with minimal cost. Expand
  • 87
  • 2
An explanation facility for today's expert systems
TLDR
The authors discuss explanation facility types found in most expert systems and shells used today, referring to these as practice systems, since they represent current practice in expert system work. Expand
  • 82
  • 2
Completeness Theorems for Semantic Resolution in Consequence-Finding
TLDR
The object of consequence-finding is to deduce l o g i c a l consequences from a set of axioms by apply ing I (semant ic) r e s o l u t i o n . Expand
  • 58
  • 2
  • PDF
A Clustering and Data-Reorganizing Algorithm
TLDR
A clustering and data-reorganizing algorithm based on the concept of the shortest spanning path of a graph is given. Expand
  • 89
  • 2
Experiments with the M & N tree-searching program
TLDR
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. Expand
  • 27
  • 2
...
1
2
3
4
5
...