Bibliography
259
[Matthews, 1986] Matthews, S. G. (1986). Metric domains for completeness.
Technical Report 76, Department of Computer Science, University of
Warwick, Coventry, UK. Ph.D. Thesis, 1985.
[Matthews, 1992] Matthews, S. G. (1992). The cycle contraction mapping
theorem. Technical Report 228, Department of Computer Science, University of Warwick, Coventry, UK.
[Matthews, 1994] Matthews, S. G. (1994). Partial metric topology. In
Andima, S., Itzkowitz, G., Kong, Y., et al., editors, Proceedings of the
Eighth Summer Conference on General Topology and Its Applications,
Queens College, CUNY, New York, USA, June, 1992, Annals of the
New York Academy of Sciences, Volume 728, pages 183–197. New York
Academy of Sciences, New York.
[McCarthy, 1977] McCarthy, J. (1977). Epistemological problems of artificial intelligence. In Proceedings of the International Joint Conference on
Artificial Intelligence (IJCAI-77), pages 1038–1044.
[McCarthy, 1980] McCarthy, J. (1980). Circumscription — A form of nonmonotonic reasoning. Artificial Intelligence, 13(1):27–39.
[Mendelson, 1987] Mendelson, E. (1987). Introduction to Mathematical Logic.
Wadsworth & Brooks/Cole Advanced Books and Software, Monterey,
CA.
[Moore, 1984] Moore, R. (1984). Possible-worlds semantics for autoepistemic
logic. In Proceedings of the 1984 Non-Monotonic Reasoning Workshop.
AAAI, Menlo Park, CA.
[Moore, 1985] Moore, R. (1985). Semantical considerations on non-monotonic
logic. Artificial Intelligence, 25(1):75–94.
[Murtagh, 2004] Murtagh, F. (2004). On ultrametricity, data coding, and
computation. Journal of Classification, 21:167–184.
[Murtagh, 2005] Murtagh, F. (2005). Identifying the ultrametricity of time
series. European Physical Journal, 43(4):573–579.
[O’Neill, 1996] O’Neill, S. J. (1996). Partial metrics, valuations, and domain theory. In Andima, S., Flagg, R., Itzkowitz, G., et al., editors,
Papers on General Topology and Applications: Eleventh Summer Conference on General Topology and Applications, University of Southern
Maine, Maine, August, 1996, Annals of the New York Academy of Sciences, pages 304–315. New York Academy of Sciences, New York.
[Pedreschi et al., 2002] Pedreschi, D., Ruggieri, S., and Smaus, J.-G. (2002).
Classes of terminating logic programs. Theory and Practice of Logic
Programming, 2(3):369–418.
259
[Matthews, 1986] Matthews, S. G. (1986). Metric domains for completeness.
Technical Report 76, Department of Computer Science, University of
Warwick, Coventry, UK. Ph.D. Thesis, 1985.
[Matthews, 1992] Matthews, S. G. (1992). The cycle contraction mapping
theorem. Technical Report 228, Department of Computer Science, University of Warwick, Coventry, UK.
[Matthews, 1994] Matthews, S. G. (1994). Partial metric topology. In
Andima, S., Itzkowitz, G., Kong, Y., et al., editors, Proceedings of the
Eighth Summer Conference on General Topology and Its Applications,
Queens College, CUNY, New York, USA, June, 1992, Annals of the
New York Academy of Sciences, Volume 728, pages 183–197. New York
Academy of Sciences, New York.
[McCarthy, 1977] McCarthy, J. (1977). Epistemological problems of artificial intelligence. In Proceedings of the International Joint Conference on
Artificial Intelligence (IJCAI-77), pages 1038–1044.
[McCarthy, 1980] McCarthy, J. (1980). Circumscription — A form of nonmonotonic reasoning. Artificial Intelligence, 13(1):27–39.
[Mendelson, 1987] Mendelson, E. (1987). Introduction to Mathematical Logic.
Wadsworth & Brooks/Cole Advanced Books and Software, Monterey,
CA.
[Moore, 1984] Moore, R. (1984). Possible-worlds semantics for autoepistemic
logic. In Proceedings of the 1984 Non-Monotonic Reasoning Workshop.
AAAI, Menlo Park, CA.
[Moore, 1985] Moore, R. (1985). Semantical considerations on non-monotonic
logic. Artificial Intelligence, 25(1):75–94.
[Murtagh, 2004] Murtagh, F. (2004). On ultrametricity, data coding, and
computation. Journal of Classification, 21:167–184.
[Murtagh, 2005] Murtagh, F. (2005). Identifying the ultrametricity of time
series. European Physical Journal, 43(4):573–579.
[O’Neill, 1996] O’Neill, S. J. (1996). Partial metrics, valuations, and domain theory. In Andima, S., Flagg, R., Itzkowitz, G., et al., editors,
Papers on General Topology and Applications: Eleventh Summer Conference on General Topology and Applications, University of Southern
Maine, Maine, August, 1996, Annals of the New York Academy of Sciences, pages 304–315. New York Academy of Sciences, New York.
[Pedreschi et al., 2002] Pedreschi, D., Ruggieri, S., and Smaus, J.-G. (2002).
Classes of terminating logic programs. Theory and Practice of Logic
Programming, 2(3):369–418.