default search action
Artificial Intelligence, Volume 43
Volume 43, Number 1, April 1990
- Hans J. Berliner, Donald F. Beal:
Introduction. 1-5 - Hans J. Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling:
Measuring the Performance Potential of Chess Programs. 7-20 - Kai-Fu Lee, Sanjoy Mahajan:
The Development of a World Class Othello Program. 21-36 - Helmut Horacek:
Reasoning with Uncertainty in Computer Chess. 37-56 - Ingo Althöfer:
An Incremental Negamax Algorithm. 57-65 - Jonathan Schaeffer:
Conspiracy Numbers. 67-84 - Donald F. Beal:
A Generalised Quiescence Search Algorithm. 85-98 - Thomas S. Anantharaman, Murray Campbell, Feng-Hsiung Hsu:
Singular Extensions: Adding Selectivity to Brute-Force Searching. 99-109 - Simon T. Dekker, H. Jaap van den Herik, I. S. Herschberg:
Perfect Knowledge Revisited. 111-123
Volume 43, Number 2, May 1990
- Antoni Ligeza:
Dynamic Backward Reasoning Systems. 127-152 - Eduard H. Hovy:
Pragmatics and Natural Language Generation. 153-197 - Susan S. Chen, James M. Keller, Richard M. Crownover:
Shape from Fractal Geometry. 199-218 - Charles Elkan:
A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems. 219-234 - Bernhard Nebel:
Terminological Reasoning is Inherently Intractable. 235-249
- Mark Derthick:
Steven Pinker and Jacques Mehler, eds., Connections and Symbols (Reprinted from Cognition: International Journal of Cognitive Science 28 (1988)). 251-265
Volume 43, Number 3, June 1990
- Robert T. Frankot, Rama Chellappa:
Estimation of Surface Topography from SAR Imagery Using Shape from Shading Techniques. 271-310 - Daniel S. Weld:
Exaggeration. 311-368
- Philip E. Agre:
Lucy A. Suchman, Plans and Situated Actions: The Problem of Human-Machine Commuinication (Cambridge University Press, Cambridge 1987). 369-384
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.