Bibliography
261
[Rojas, 1996] Rojas, R. (1996). Neural Networks. Springer, Berlin.
[Romaguera and Schellekens, 2003] Romaguera, S. and Schellekens, M.
(2003). Norm-weightable Riesz spaces and the dual complexity space.
In Hurley, T., MacanAirchinnigh, M., Schellekens, M., and Seda, A. K.,
editors, Proceedings of the Second Irish Conference on the Mathematical
Foundations of Computer Science and Information Technology (MFCSIT2002), Galway, Ireland, July, 2002, Electronic Notes in Theoretical
Computer Science, Volume 74, pages 1–17. Elsevier Science Publishers,
Amsterdam; New York.
[Rounds and Zhang, 2001] Rounds, W. C. and Zhang, G.-Q. (2001). Clausal
logic and logic programming in algebraic domains. Information and Computation, 171(2):156–182.
[Rumelhart et al., 1986] Rumelhart, D. E., Hinton, G. E., and Williams., R. J.
(1986). Learning internal representations by error propagation. In McClelland, J. L. and Rumelhart, D. E., editors, Parallel Distributed Processing, pages 318–362. MIT Press, Cambridge, MA.
[Rutten, 1995] Rutten, J. J. (1995). Elements of generalized ultrametric domain theory. Technical Report CS-R9507, CWI, Stichting Mathematisch
Centrum, Amsterdam, The Netherlands.
[Rutten, 1996] Rutten, J. J. (1996). Elements of generalized ultrametric domain theory. Theoretical Computer Science, 170:349–381. Revised version
of [Rutten, 1995].
[Scott, 1982a] Scott, D. S. (1982a). Domains for denotational semantics. In
Nielsen, M. and Schmidt, E. M., editors, Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings, Lecture Notes in Computer Science, Volume 140, pages 577–613.
Springer, Berlin.
[Scott, 1982b] Scott, D. S. (1982b). Lecture notes on a mathematical theory
of computation. In Broy, M. and Schmidt, G., editors, Theoretical Foundations of Programming Methodology, pages 145–292. Reidel, Dordrecht.
[Scutell` a, 1990] Scutell` a, M. G. (1990). A note on Dowling and Gallier’s topdown algorithm for propositional Horn satisfiability. The Journal of Logic
Programming, 8:265–273.
[Seda, 1995] Seda, A. K. (1995). Topology and the semantics of logic programs. Fundamenta Informaticae, 24(4):359–386.
[Seda, 1997] Seda, A. K. (1997). Quasimetrics and the semantics of logic
programs. Fundamenta Informaticae, 29(1):97–117.
[Seda, 2002] Seda, A. K. (2002). Some convergence issues in theoretical computer science. Information, 5(4):447–462.
261
[Rojas, 1996] Rojas, R. (1996). Neural Networks. Springer, Berlin.
[Romaguera and Schellekens, 2003] Romaguera, S. and Schellekens, M.
(2003). Norm-weightable Riesz spaces and the dual complexity space.
In Hurley, T., MacanAirchinnigh, M., Schellekens, M., and Seda, A. K.,
editors, Proceedings of the Second Irish Conference on the Mathematical
Foundations of Computer Science and Information Technology (MFCSIT2002), Galway, Ireland, July, 2002, Electronic Notes in Theoretical
Computer Science, Volume 74, pages 1–17. Elsevier Science Publishers,
Amsterdam; New York.
[Rounds and Zhang, 2001] Rounds, W. C. and Zhang, G.-Q. (2001). Clausal
logic and logic programming in algebraic domains. Information and Computation, 171(2):156–182.
[Rumelhart et al., 1986] Rumelhart, D. E., Hinton, G. E., and Williams., R. J.
(1986). Learning internal representations by error propagation. In McClelland, J. L. and Rumelhart, D. E., editors, Parallel Distributed Processing, pages 318–362. MIT Press, Cambridge, MA.
[Rutten, 1995] Rutten, J. J. (1995). Elements of generalized ultrametric domain theory. Technical Report CS-R9507, CWI, Stichting Mathematisch
Centrum, Amsterdam, The Netherlands.
[Rutten, 1996] Rutten, J. J. (1996). Elements of generalized ultrametric domain theory. Theoretical Computer Science, 170:349–381. Revised version
of [Rutten, 1995].
[Scott, 1982a] Scott, D. S. (1982a). Domains for denotational semantics. In
Nielsen, M. and Schmidt, E. M., editors, Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings, Lecture Notes in Computer Science, Volume 140, pages 577–613.
Springer, Berlin.
[Scott, 1982b] Scott, D. S. (1982b). Lecture notes on a mathematical theory
of computation. In Broy, M. and Schmidt, G., editors, Theoretical Foundations of Programming Methodology, pages 145–292. Reidel, Dordrecht.
[Scutell` a, 1990] Scutell` a, M. G. (1990). A note on Dowling and Gallier’s topdown algorithm for propositional Horn satisfiability. The Journal of Logic
Programming, 8:265–273.
[Seda, 1995] Seda, A. K. (1995). Topology and the semantics of logic programs. Fundamenta Informaticae, 24(4):359–386.
[Seda, 1997] Seda, A. K. (1997). Quasimetrics and the semantics of logic
programs. Fundamenta Informaticae, 29(1):97–117.
[Seda, 2002] Seda, A. K. (2002). Some convergence issues in theoretical computer science. Information, 5(4):447–462.