1481. Swade D. D. (1993) Redeeming Charles Babbage's mechanical computer. Scientific American,268(2), p. 86-91.

1482. Swerling P. (1959) First order error propagation in a stagewise smoothing procedure for satelliteobservations. Journal of Astronautical Sciences, 6, p. 46—52.

1483. Swift T. and Warren D. S. (1994) Analysis of SLG-WAM evaluation of definite programs. In LogicProgramming. Proceedings of the 1994 International Symposium, p. 219-235, Ithaca, NY. MIT Press.

1484. Syrjanen T. (2000) Lparse 1.0 user's manual.http://saturn.tcs.hut.fi/Software/smodels.

1485. Tadepalli P. (1993) Learning from queries and examples with tree-structured bias. In Proceedings ofthe Tenth International Conference on Machine Learning, p. 322-329, Amherst, Massachusetts. Morgan Kaufmann.

1486. Tait P. G. (1880) Note on the theory of the "15 puzzle". Proceedings of the Royal Society ofEdinburgh, 10, p. 664-665.

1487. Tamaki H. and Sato T. (1986) OLD resolution with tabulation. In Third International Conference onLogic Programming, p. 84-98, London. Springer-Verlag.

1488.Tambe M., Newell A., and Rosenbloom P. S. (1990) The problem of expensive chunks and its solution by restricting expressiveness. Machine Learning, 5, p. 299-348.

1489.Tarjan R. E. (1983) Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM (Society for Industrial and Applied Mathematics, Philadelphia.

1490. Tarski A. (1935) Die Wahrheitsbegriff in den formalisierten Sprachen. Studia Philosophica, 1, p. 261-405.

1491.Tarski A. (1956) Logic, Semanticsy Metamathematics: Papers from 1923 to 1938. Oxford University Press, Oxford, UK.

1492. Tash J. K. and Russell S. J. (1994) Control strategies for a stochastic planner. In Proceedings of theTwelfth National Conference on Artificial Intelligence (AAAI-94), p. 1079-1085, Seattle. AAAI Press.

1493. Tate A. (1975a) Interacting goals and their use. In Proceedings of the Fourth International JointConference on Artificial Intelligence (IJCAI-75), p. 215-218, Tbilisi, Georgia. IJCAII.

1494. Tate A. (1975b) Using Goal Structure to Direct Search in a Problem Solver. Ph.D. thesis, University ofEdinburgh, Edinburgh, Scotland.

1495. Tate A. (1977) Generating project networks. In Proceedings of the Fifth International Joint Conferenceon Artificial Intelligence (IJCAI-77), p. 888-893, Cambridge, Massachusetts. IJCAII.

1496. Tate A. and Whiter A. M. (1984) Planning with multiple resource constraints and an application to anaval planning problem. In Proceedings of the First Conference on AI Applications, p. 410-416, Denver, Colorado.

1497. Tatman J. A. and Shachter R. D. (1990) Dynamic programming and influence diagrams. IEEETransactions on Systems, Man and Cybernetics, 20(2), p. 365—379.

1498. Tesauro G. (1989) Neurogammon wins computer olympiad. Neural Computation, 7(3), p. 321-323.

1499. Tesauro G. (1992) Practical issues in temporal difference learning. Machine Learning, #(3-4),p. 257-277.

1500. Tesauro G. (1995) Temporal difference learning and TD-Gammon. Communications of theAssociation forComputing Machinery, 38(3), p. 58—68.