Bibliography
257
[Kr¨ otzsch, 2006] Kr¨ otzsch, M. (2006). Generalized ultrametric spaces in quantitative domain theory. Theoretical Computer Science, 368(1–2):30–49.
[Kr¨ otzsch et al., 2008] Kr¨ otzsch, M., Rudolph, S., and Hitzler, P. (2008).
ELP: Tractable rules for OWL 2. In Sheth, A., Staab, S., Dean, M.,
Paolucci, M., Maynard, D., Finin, T., and Thirunarayan, K., editors,
Proceedings of the 7th International Semantic Web Conference (ISWC08), Lecture Notes in Computer Science, Volume 5318, pages 649–664.
Springer, Berlin.
[Kuhlmann, 1999] Kuhlmann, F.-V. (1999). A theorem about maps on spherically complete ultrametric spaces, and its applications. Preprint, Department of Mathematics and Statistics, University of Saskatchewan in
Saskatoon, 20 pages.
[K¨ unzi, 2001] K¨ unzi, H.-P. A. (2001). Non-symmetric distances and their
associated topologies: About the origins of basic ideas in the area of
asymmetric topology. In Aull, C. E. and Lowen, R., editors, Handbook
of the History of General Topology, Volume 3, pages 853–968. Kluwer
Academic Publishers, Dordrecht.
[K¨ unzi and Kivuvu, 2008] K¨ unzi, H.-P. A. and Kivuvu, C. M. (2008). A double completion for an arbitrary T 0 -quasimetric space. Journal of Logic
and Algebraic Programming, 76(2):251–269.
[K¨ unzi et al., 2006] K¨ unzi, H.-P. A., Pajoohesh, H., and Schellekens, M.
(2006). Partial quasimetrics. Theoretical Computer Science, 365:237–
246.
[Lane and Seda, 2006] Lane, M. and Seda, A. K. (2006). Some aspects of
the integration of connectionist and logic-based systems. Information,
9(4):551–562.
[Lane and Seda, 2009] Lane, M. and Seda, A. K. (2009). Properties of general semantic operators determined by logic-based systems. In Hurley,
T., MacanAirchinnigh, M., Schellekens, M., Seda, A. K., and Strong, G.,
editors, Proceedings of the Fourth Irish Conference on the Mathematical
Foundations of Computer Science and Information Technology (MFCSIT2006), University College Cork, August, 2006, Electronic Notes in
Theoretical Computer Science, Volume 225, pages 181–194. Elsevier Science Publishers, Amsterdam; New York.
[Lassez et al., 1982] Lassez, J.-L., Nguyen, V., and Sonenberg, L. (1982).
Fixed-point theorems and semantics: A folk tale. Information Processing
Letters, 14(3):112–116.
[Lehmann et al., 2010] Lehmann, J., Bader, S., and Hitzler, P. (2010). Extracting reduced logic programs from artificial neural networks. Applied
Intelligence, 32(3):249–266.
257
[Kr¨ otzsch, 2006] Kr¨ otzsch, M. (2006). Generalized ultrametric spaces in quantitative domain theory. Theoretical Computer Science, 368(1–2):30–49.
[Kr¨ otzsch et al., 2008] Kr¨ otzsch, M., Rudolph, S., and Hitzler, P. (2008).
ELP: Tractable rules for OWL 2. In Sheth, A., Staab, S., Dean, M.,
Paolucci, M., Maynard, D., Finin, T., and Thirunarayan, K., editors,
Proceedings of the 7th International Semantic Web Conference (ISWC08), Lecture Notes in Computer Science, Volume 5318, pages 649–664.
Springer, Berlin.
[Kuhlmann, 1999] Kuhlmann, F.-V. (1999). A theorem about maps on spherically complete ultrametric spaces, and its applications. Preprint, Department of Mathematics and Statistics, University of Saskatchewan in
Saskatoon, 20 pages.
[K¨ unzi, 2001] K¨ unzi, H.-P. A. (2001). Non-symmetric distances and their
associated topologies: About the origins of basic ideas in the area of
asymmetric topology. In Aull, C. E. and Lowen, R., editors, Handbook
of the History of General Topology, Volume 3, pages 853–968. Kluwer
Academic Publishers, Dordrecht.
[K¨ unzi and Kivuvu, 2008] K¨ unzi, H.-P. A. and Kivuvu, C. M. (2008). A double completion for an arbitrary T 0 -quasimetric space. Journal of Logic
and Algebraic Programming, 76(2):251–269.
[K¨ unzi et al., 2006] K¨ unzi, H.-P. A., Pajoohesh, H., and Schellekens, M.
(2006). Partial quasimetrics. Theoretical Computer Science, 365:237–
246.
[Lane and Seda, 2006] Lane, M. and Seda, A. K. (2006). Some aspects of
the integration of connectionist and logic-based systems. Information,
9(4):551–562.
[Lane and Seda, 2009] Lane, M. and Seda, A. K. (2009). Properties of general semantic operators determined by logic-based systems. In Hurley,
T., MacanAirchinnigh, M., Schellekens, M., Seda, A. K., and Strong, G.,
editors, Proceedings of the Fourth Irish Conference on the Mathematical
Foundations of Computer Science and Information Technology (MFCSIT2006), University College Cork, August, 2006, Electronic Notes in
Theoretical Computer Science, Volume 225, pages 181–194. Elsevier Science Publishers, Amsterdam; New York.
[Lassez et al., 1982] Lassez, J.-L., Nguyen, V., and Sonenberg, L. (1982).
Fixed-point theorems and semantics: A folk tale. Information Processing
Letters, 14(3):112–116.
[Lehmann et al., 2010] Lehmann, J., Bader, S., and Hitzler, P. (2010). Extracting reduced logic programs from artificial neural networks. Applied
Intelligence, 32(3):249–266.