Главная arrow книги arrow Копия Литература arrow Литература
Литература

1181. Paterson M. S. and Wegman M. N. (1978) Linear unification. Journal of Computer and SystemSciences, 16, p. 158-167.

1182. Patrick B. G., AlmuUa M., and Newborn M. M. (1992) An upper bound on the time complexity ofiterative-deepening- A*. Annals of Mathematics and Artificial Intelligence, 5(2-4), p. 265-278.

1183. Patten T. (1988) Systemic Text Generation as Problem Solving. Studies in Natural LanguageProcessing. Cambridge University Press, Cambridge, UK.

1184. Paul R. P. (1981) Robot Manipulators: Mathematics, Programming, and Control. MIT Press,Cambridge, Massachusetts.

1185. Peano G. (1889) Arithmeticesprincipia, nova methodo exposita. Fratres Bocca, Turin.

1186. Pearl J. (1982a) Reverend Bayes on inference engines: A distributed hierarchical approach. InProceedings of the National Conference on Artificial Intelligence (AAAI-82), p. 133-136, Pittsburgh, Pennsylvania. Morgan Kaufmann.

1187. Pearl J. (1982b) The solution for the branching factor of the alpha-beta pruning algorithm and itsoptimality. Communications of the Association for Computing Machinery, 25(8), p. 559—564.

1188. Pearl J. (1984) Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley,Reading, Massachusetts.

1189. Pearl J. (1986) Fusion, propagation, and structuring in belief networks. Artificial Intelligence, 29,p. 241-288.

1190. Pearl J. (1987) Evidential reasoning using stochastic simulation of causal models. ArtificialIntelligence, 32, p. 247-257.

1191. Pearl J. (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. MorganKaufmann, San Mateo, California.

1192. Pearl J. (2000) Causality: Models, Reasoning, and Inference. Cambridge University Press, Cambridge, UK.

1193. Pearl J. and Verma T. (1991) A theory of inferred causation. In Allen J. A., Fikes R., and SandewallE. (Eds.), Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, p. 441-452, San Mateo, California. Morgan Kaufmann.

1194. Pearson J. and Jeavons P. (1997) A survey of tractable constraint satisfaction problems. Technicalreport CSD-TR-97-15, Royal Holloway College U. of London.

1195. Pednault E. P. D. (1986) Formulating multiagent, dynamic-world problems in the classical planningframework. In Georgeff M. P. and Lansky A. L. (Eds.) Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, p. 47-82, Timberline, Oregon. Morgan Kaufmann.

1196. Peirce С S. (1870) Description of a notation for the logic of relatives, resulting from an amplificationof the conceptions of Boole's calculus of logic. Memoirs of the American Academy of Arts and Sciences, 9, p. 317-378.

1197. Peirce C. S. (1883) A theory of probable inference. Note B. The logic of relatives. In Studies in Logicby Members of the Johns Hopkins University, p. 187-203, Boston.

1198. Peirce С S. (1902) Logic as semiotic: The theory of signs. Неопубликованная рукопись; перепе-чатана в Buchler В. (1955) Philosopical Writings of Peirce. Dover Publications, New York.

1199. Peirce C. S. (1909) Existential graphs. Неопубликованная рукопись; перепечатана в Buchler В.(1955) Philosopical Writings of Peirce. Dover Publications, New York.

1200. Pelikan M, Goldberg D. E., and Cantu-Paz E. (1999) BOA: The Bayesian optimization algorithm.In GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, p. 525-532, Orlando, Florida. Morgan Kaufmann.