521. Gaschnig J. (1977) A general backtrack algorithm that eliminates most redundant tests. In Proceedingsof the Fifth International Joint Conference on Artificial Intelligence (IJCAI-77), p. 457, Cambridge, Massachusetts. IJCAII.

522. Gaschnig J. (1979) Performance measurement and analysis of certain search algorithms. Technicalreport CMU-CS-79-124, Computer Science Department, Carnegie-Mellon University.

523. Gasser R. (1995) Efficiently harnessing computational resources for exhaustive search. Ph.D. thesis, ETHZurich, Switzerland.

524. Gasser R. (1998) Solving nine men's morris. In Nowakowski R. (Ed.) Games of No Chance. CambridgeUniversity Press, Cambridge, UK.

525. Gat E. (1998) Three-layered architectures. In Kortenkamp D., Bonasso R. P., and Murphy R. (Eds.)Al-based Mobile Robots: Case Studies of Successful Robot Systems, p. 195-210. MIT Press.

526. Gauss K. F. (1809) Theoria Motus Corporum Coelestium in Sectionibus Conicis Solem Ambientium.Sumtibus F. Perthes et I. H. Besser, Hamburg.

527. Gauss K. F. (1829) Beitrage zur theorie der algebraischen gleichungen. Collected in Werke, Vol. 3,p. 71-102. K. Gesellschaft Wissenschaft, Gbttingen, Germany, 1876.

528. Gawande A. (2002) Complications: A Surgeon's Notes on an Imperfect Science. Metropolitan Books,New York.

529. Ge N., Hale J., and Charniak E. (1998) A statistical approach to anaphora resolution. In Proceedingsof the Sixth Workshopon Very Large Corpora, p. 161-171, Montreal. COLING-ACL.

530. Geiger D., Verma Т., and Pearl J. (1990) Identifying independence in Bayesian networks. Networks,20(5), p. 507-534.

531. Gelb A. (1974) Applied Optimal Estimation. MIT Press, Cambridge, Massachusetts.

532. Gelernter H. (1959) Realization of a geometry-theorem proving machine. In Proceedings of anInternational Conference on Information Processing, p. 273—282, Paris. UNESCO House.

533. Gelfond M. and Lifschitz V. (1988) Compiling circumscriptive theories into logic programs. InReinfrank M., de Kleer J., Ginsberg M. L., and Sandewall E. (Eds.), Non-Monotonic Reasoning: 2nd International Workshop Proceedings, p. 74—99, Grassau, Germany. Springer-Verlag.

534. Gelman A., Carlin J. В., Stern H. S., and Rubin D. (1995) Bayesian Data Analysis. Chapman & Hall,London.

535. Geman S. and Geman D. (1984) Stochastic relaxation, Gibbs distributions, and Bayesian restoration ofimages. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 5(6), p. 721—741.

536. Genesereth M. R. (1984) The use of design descriptions in automated diagnosis. Artificial Intelligence,24(1-3), p. 411-436.

537. Genesereth M. R. and Nilsson N. J. (1987) Logical Foundations of Artificial Intelligence. MorganKaufmann, San Mateo, California.

538. Genesereth M. R. and Nourbakhsh I. (1993) Time-saving tips for problem solving with incompleteinformation. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), p. 724-730, Washington, DC. AAAI Press.

539. Genesereth M. R. and Smith D. E. (1981) Meta-level architecture. Memo HPP-81-6, ComputerScience Department, Stanford University, Stanford, California.

540. Gentner D. (1983) Structure mapping: A theoretical framework for analogy. Cognitive Science, 7,p. 155-170.