601. Gu J. (1989) Parallel Algorithms and Architectures for Very Fast AI Search. Ph.D. thesis, University of Utah.

602. Guard J., Oglesby F., Bennett J., and Settle L. (1969) Semi-automated mathematics. Journal of theAssociation for Computing Machinery, 16, p. 49—62.

603. Guibas L. J., Knuth D. E., and Sharir M. (1992) Randomized incremental construction of Delaunayand Voronoi diagrams. Algorithmica, 7, 381—413. See also 17th Int. Coll. on Automata, Languages and Programming, 1990, p. 414-431.

604. Haas A. (1986) A syntactic theory of belief and action. Artificial Intelligence, 28(3), p. 245-292.

605. Hacking I. (1975) The Emergence of Probability. Cambridge University Press, Cambridge, UK.

606. Hald A. (1990) A History of Probability and Statistics and Their Applications before 1750. Wiley, New York.

607. Halpern J. Y. (1990) An analysis of first-order logics of probability. Artificial Intelligence, 46(3),p. 311-350.

608. Hamming R. W. (1991) The Art of Probability for Scientists and Engineers. Addison-Wesley, Reading,Massachusetts.

609. Hammond K. (1989) Case-Based Planning: Viewing Planning as a Memory Task. Academic Press, New York.

610. Hamscher W., Console L., and Kleer J. D. (1992) Readings in Model-based Diagnosis. MorganKaufmann, San Mateo, California.

611. Handschin J. E. and Mayne D. Q. (1969) Monte Carlo techniques to estimate the conditionalexpectation in multi-stage nonlinear filtering. International Journal of Control, 9(5), p. 547—559.

612. Hansen E. (1998) Solving POMDPs by searching in policy space. In Uncertainty in ArtificialIntelligence: Proceedings of the Fourteenth Conference, p. 211—219, Madison, Wisconsin. Morgan Kaufmann.

613. Hansen E. and Zilberstein S. (2001) LAO*: a heuristic search algorithm that finds solutions with loops.Artificial Intelligence, 129(1-2), p. 35-62.

614. Hansen P. and Jaumard B. (1990) Algorithms for the maximum satisfiability problem. Computing,44(A), p. 279-303.

615. Hanski I. and Cambefort Y. (Eds.) (1991) Dung Beetle Ecology. Princeton University Press, Princeton,New Jersey.

616. Hansson O. and Mayer A. (1989) Heuristic search as evidential reasoning. In Proceedings of the FifthWorkshop on Uncertainty in Artificial Intelligence, Windsor, Ontario. Morgan Kaufmann.

617. Hansson €)., Mayer A., and Yung M. (1992) Criticizing solutions to relaxed models yields powerfuladmissible heuristics. Information Sciences, 63(3), p. 207—227.

618. Haralick R. M. and Elliot G. L. (1980) Increasing tree search efficiency for constraint satisfactionproblems. Artificial Intelligence, 14(3), p. 263—313.

619. Hardin G. (1968) The tragedy of the commons. Science, 162, p. 1243-1248.

620. Harel D. (1984) Dynamic logic. In Gabbay D. and Guenthner F. (Eds.), Handbook of PhilosophicalLogic, Vol. 2, p. 497-604. D. Reidel, Dordrecht, Netherlands.