262
Bibliography
[Seda, 2006] Seda, A. K. (2006). On the integration of connectionist and
logic-based systems. In Hurley, T., MacanAirchinnigh, M., Schellekens,
M., Seda, A. K., and Strong, G., editors, Proceedings of the Third Irish
Conference on the Mathematical Foundations of Computer Science and
Information Technology (MFCSIT2004), Trinity College Dublin, Ireland,
July, 2004, Electronic Notes in Theoretical Computer Science, Volume
161, pages 109–130. Elsevier Science Publishers, Amsterdam; New York.
[Seda, 2007] Seda, A. K. (2007). Morphisms of ANN and the computation of
´
least fixed points of semantic operators. In Mira, J. and Alvarez, J. R.,
editors, Proceedings of the Second International Work-Conference on the
Interplay Between Natural and Artificial Computation (IWINAC2007),
Murcia, Spain, June, 2007, Part 1, Lecture Notes in Computer Science,
Volume 4527, pages 224–233. Springer, Berlin.
[Seda and Hitzler, 1999a] Seda, A. K. and Hitzler, P. (1999a). Strictly leveldecreasing logic programs. In Butterfield, A. and Flynn, S., editors, Proceedings of the Second Irish Workshop on Formal Methods (IWFM’98),
NUI, Cork, Ireland, July, 1998, Electronic Workshops in Computing,
pages 1–18. British Computer Society, Swindon, UK.
[Seda and Hitzler, 1999b] Seda, A. K. and Hitzler, P. (1999b). Topology and
iterates in computational logic. In Flagg, R., Hart, K., Norden, J., Tymchatyn, E., and Tuncali, M., editors, Proceedings of the 12th Summer
Conference on Topology and Its Applications: Special Session on Topology in Computer Science, Ontario, Canada, August, 1997, Volume 22 of
Topology Proceedings, pages 427–469.
[Seda and Hitzler, 2010] Seda, A. K. and Hitzler, P. (2010). Generalized distance functions in the theory of computation. The Computer Journal,
53(4):443–464.
[Seda and Lane, 2003] Seda, A. K. and Lane, M. (2003). On continuous models of computation: Towards computing the distance between (logic) programs. In Morris, J., Aziz, B., and Oehl, F., editors, Proceedings of the
Sixth International Workshop in Formal Methods (IWFM’03), Dublin
City University, Dublin, Ireland, July, 2003, Electronic Workshops in
Computing, pages 1–15. British Computer Society, Swindon, UK.
[Seda and Lane, 2005] Seda, A. K. and Lane, M. (2005). On the measurability
of the semantic operators determined by logic programs. Information,
8(1):33–52.
[Seda et al., 2003] Seda, A. K., Heinze, R., and Hitzler, P. (2003). Convergence classes and spaces of partial functions. In Domain Theory, Logic
and Computation. Proceedings of the 2nd International Symposium on
Bibliography
[Seda, 2006] Seda, A. K. (2006). On the integration of connectionist and
logic-based systems. In Hurley, T., MacanAirchinnigh, M., Schellekens,
M., Seda, A. K., and Strong, G., editors, Proceedings of the Third Irish
Conference on the Mathematical Foundations of Computer Science and
Information Technology (MFCSIT2004), Trinity College Dublin, Ireland,
July, 2004, Electronic Notes in Theoretical Computer Science, Volume
161, pages 109–130. Elsevier Science Publishers, Amsterdam; New York.
[Seda, 2007] Seda, A. K. (2007). Morphisms of ANN and the computation of
´
least fixed points of semantic operators. In Mira, J. and Alvarez, J. R.,
editors, Proceedings of the Second International Work-Conference on the
Interplay Between Natural and Artificial Computation (IWINAC2007),
Murcia, Spain, June, 2007, Part 1, Lecture Notes in Computer Science,
Volume 4527, pages 224–233. Springer, Berlin.
[Seda and Hitzler, 1999a] Seda, A. K. and Hitzler, P. (1999a). Strictly leveldecreasing logic programs. In Butterfield, A. and Flynn, S., editors, Proceedings of the Second Irish Workshop on Formal Methods (IWFM’98),
NUI, Cork, Ireland, July, 1998, Electronic Workshops in Computing,
pages 1–18. British Computer Society, Swindon, UK.
[Seda and Hitzler, 1999b] Seda, A. K. and Hitzler, P. (1999b). Topology and
iterates in computational logic. In Flagg, R., Hart, K., Norden, J., Tymchatyn, E., and Tuncali, M., editors, Proceedings of the 12th Summer
Conference on Topology and Its Applications: Special Session on Topology in Computer Science, Ontario, Canada, August, 1997, Volume 22 of
Topology Proceedings, pages 427–469.
[Seda and Hitzler, 2010] Seda, A. K. and Hitzler, P. (2010). Generalized distance functions in the theory of computation. The Computer Journal,
53(4):443–464.
[Seda and Lane, 2003] Seda, A. K. and Lane, M. (2003). On continuous models of computation: Towards computing the distance between (logic) programs. In Morris, J., Aziz, B., and Oehl, F., editors, Proceedings of the
Sixth International Workshop in Formal Methods (IWFM’03), Dublin
City University, Dublin, Ireland, July, 2003, Electronic Workshops in
Computing, pages 1–15. British Computer Society, Swindon, UK.
[Seda and Lane, 2005] Seda, A. K. and Lane, M. (2005). On the measurability
of the semantic operators determined by logic programs. Information,
8(1):33–52.
[Seda et al., 2003] Seda, A. K., Heinze, R., and Hitzler, P. (2003). Convergence classes and spaces of partial functions. In Domain Theory, Logic
and Computation. Proceedings of the 2nd International Symposium on