Bibliography
255
[Hornik et al., 1989] Hornik, K., Stinchcombe, M., and White, H. (1989).
Multilayer feedforward networks are universal approximators. Neural
Networks, 2:359–366.
[Istr˘ at ¸escu, 1981] Istr˘ at ¸escu, V. I. (1981). Fixed Point Theory — An Introduction, Volume 7, Mathematics and Its Applications. D. Reidel Publishing
Company, Dordrecht, Holland.
[Jachymski, 2000] Jachymski, J. (2000). A short proof of the converse of the
contraction principle and some related results. Topological Methods in
Nonlinear Analysis, 15:179–186.
[Jachymski, 2001] Jachymski, J. (2001). Order-theoretic aspects of metric
fixed-point theory. In Kirk, W. A. and Sims, B., editors, Handbook of
Metric Fixed Point Theory, pages 613–641. Kluwer Academic Publishers,
Dordrecht, The Netherlands.
[Jacobsson, 2005] Jacobsson, H. (2005). Rule extraction from recurrent neural
networks: A taxonomy and review. Neural Computation, 17(6):1223–
1263.
[Jones and Laaser, 1977] Jones, N. D. and Laaser, W. T. (1977). Complete
problems for deterministic sequential time. Theoretical Computer Science, 3:105–117.
[Kalinke, 1994] Kalinke, Y. (1994). Ein massiv paralleles Berechnungsmodell
f¨ ur normale logische Programme. PhD thesis, Department of Computer
Science, Dresden University of Technology, Dresden, Germany.
[Karp and Ramachandran, 1990] Karp, R. M. and Ramachandran, V. (1990).
Parallel algorithms for shared-memory machines. In van Leeuwen, J.,
editor, Handbook of Theoretical Computer Science, Chapter 17, pages
869–941. Elsevier Science Publishers, New York.
[Kelley, 1975] Kelley, J. L. (1975). General Topology. Graduate Texts in
Mathematics, Volume 27. Springer-Verlag, Berlin.
[Khamsi and Misane, 1998] Khamsi, M. A. and Misane, D. (1997/1998). Disjunctive signed logic programs. Fundamenta Informaticae, 32(3–4):349–
357.
[Khamsi et al., 1993] Khamsi, M. A., Kreinovich, V., and Misane, D. (1993).
A new method of proving the existence of answer sets for disjunctive logic
programs: A metric fixed-point theorem for multivalued mappings. In
Baral, C. and Gelfond, M., editors, Proceedings of the Workshop on Logic
Programming with Incomplete Information, Vancouver, B.C., Canada,
pages 58–73. University of British Columbia, Vancouver, BC.
[Khrennikov, 1998] Khrennikov, A. Y. (1998). Human subconscious as the
p-adic dynamical system. Journal of Theoretical Biology, 193:179–196.
255
[Hornik et al., 1989] Hornik, K., Stinchcombe, M., and White, H. (1989).
Multilayer feedforward networks are universal approximators. Neural
Networks, 2:359–366.
[Istr˘ at ¸escu, 1981] Istr˘ at ¸escu, V. I. (1981). Fixed Point Theory — An Introduction, Volume 7, Mathematics and Its Applications. D. Reidel Publishing
Company, Dordrecht, Holland.
[Jachymski, 2000] Jachymski, J. (2000). A short proof of the converse of the
contraction principle and some related results. Topological Methods in
Nonlinear Analysis, 15:179–186.
[Jachymski, 2001] Jachymski, J. (2001). Order-theoretic aspects of metric
fixed-point theory. In Kirk, W. A. and Sims, B., editors, Handbook of
Metric Fixed Point Theory, pages 613–641. Kluwer Academic Publishers,
Dordrecht, The Netherlands.
[Jacobsson, 2005] Jacobsson, H. (2005). Rule extraction from recurrent neural
networks: A taxonomy and review. Neural Computation, 17(6):1223–
1263.
[Jones and Laaser, 1977] Jones, N. D. and Laaser, W. T. (1977). Complete
problems for deterministic sequential time. Theoretical Computer Science, 3:105–117.
[Kalinke, 1994] Kalinke, Y. (1994). Ein massiv paralleles Berechnungsmodell
f¨ ur normale logische Programme. PhD thesis, Department of Computer
Science, Dresden University of Technology, Dresden, Germany.
[Karp and Ramachandran, 1990] Karp, R. M. and Ramachandran, V. (1990).
Parallel algorithms for shared-memory machines. In van Leeuwen, J.,
editor, Handbook of Theoretical Computer Science, Chapter 17, pages
869–941. Elsevier Science Publishers, New York.
[Kelley, 1975] Kelley, J. L. (1975). General Topology. Graduate Texts in
Mathematics, Volume 27. Springer-Verlag, Berlin.
[Khamsi and Misane, 1998] Khamsi, M. A. and Misane, D. (1997/1998). Disjunctive signed logic programs. Fundamenta Informaticae, 32(3–4):349–
357.
[Khamsi et al., 1993] Khamsi, M. A., Kreinovich, V., and Misane, D. (1993).
A new method of proving the existence of answer sets for disjunctive logic
programs: A metric fixed-point theorem for multivalued mappings. In
Baral, C. and Gelfond, M., editors, Proceedings of the Workshop on Logic
Programming with Incomplete Information, Vancouver, B.C., Canada,
pages 58–73. University of British Columbia, Vancouver, BC.
[Khrennikov, 1998] Khrennikov, A. Y. (1998). Human subconscious as the
p-adic dynamical system. Journal of Theoretical Biology, 193:179–196.