Artificial Intelligence, Volume 21

Volume 21, Numbers 1-2, March, 1983

• Herbert A. Simon: Search and Reasoning in Problem Solving. 7-29 BibTeX
• Douglas B. Lenat: Theory Formation by Heuristic Search. 31-59 BibTeX
• Douglas B. Lenat: EURISKO: A Program That Learns New Heuristics and Domain Concepts. 61-98 BibTeX
• Richard M. Karp, Judea Pearl: Searching for an Optimal Path in a Tree with Random Costs. 99-116 BibTeX
• Paul Walton Purdom Jr.: Search Rearrangement Backtracking and Polynomial Average Time. 117-133 BibTeX
• Bernard Nudel: Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics. 135-178 BibTeX
• Vipin Kumar, Laveen N. Kanal: A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures. 179-198 BibTeX
• Igor Roizen, Judea Pearl: A Minimax Algorithm Better Than Alpha-Beta? Yes and No. 199-220 BibTeX
• Dana S. Nau: Pathology on Game Trees Revisited, and an Alternative to Minimaxing. 221-244 BibTeX
• Glenn S. Fowler, Robert M. Haralick, F. Gail Gray, Charles Feustel, Charles Grinstead: Efficient Graph Automorphism by Vertex Partitioning. 245-269 BibTeX

Volume 21, Number 3, September, 1983

• Michael Brady: Parallelism in Vision. 271-283 BibTeX
• William R. Swartout: XPLAIN: A System for Creating and Explaining Expert Consulting Programs. 285-325 BibTeX
• Bruce W. Ballard: The *-Minimax Search Procedure for Trees Containing Chance Nodes. 327-350 BibTeX

• Reid G. Smith: J. E. Hayes, D. Michie and Y.-H. Pao (editors), Machine Intelligence 10. 351-357 BibTeX
• Peter Paul Schreiber: Günther Palm, Neural Assemblies - An Alternative Approach to Artificial Intelligence, Part I. 358-359 BibTeX

Volume 21, Number 4, November, 1983

• Michael Lebowitz: Memory-Based Parsing. 363-404 BibTeX
• Nevin M. Darwish: A Quantitative Analysis of the Alpha-Beta Pruning Algorithm. 405-433 BibTeX
• Stephen T. Barnard: Interpreting Perspective Image. 435-462 BibTeX