Journals in DBLP

Artif. Intell.
1983, volume: 21, number: 1-2

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