Generalized Distance Functions in the Theory of Computation

Computer Journal

Volumn 53, Issue 4, 2010, Pages 443-464

  Seda, Anthony Karel ^a   Hitzler, Pascal ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Denotational semantics; Fixed point theorems; Generalized distance functions; Logic programming; Stable model; Supported model; Topology; Ultra metrics

Indexed keywords

DENOTATIONAL SEMANTICS; DISTANCE FUNCTIONS; FIXED POINT THEOREMS; GENERALIZED DISTANCE FUNCTIONS; STABLE MODEL; SUPPORTED MODEL;

LOGIC PROGRAMMING; SEMANTICS; TOPOLOGY;

COMPUTATION THEORY;

EID: 77951912084     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm108     Document Type: Article

References (97)

1. Smyth, M. B. (1992) Topology. In Abramsky, S., Gabbay, D. M. and Maibaum, T. S. (eds), Handbook of Logic in Computer Science, Vol. 1, pp. 641-761. Oxford University Press, Oxford, UK.
2. Blair, H. A., Dushin, F., Jakel, D. W., Rivera, A. J. and Sezgin, M. (1999) Continuous Models of Computation for Logic Programs. In Apt, K. R., Marek, V. W., Truszczyński, M. and Warren, D. S. (eds), The Logic Programming Paradigm: A 25-Year Persepective, pp. 231-255. Springer, Berlin.
3. Kopperman, R. (1988) All topologies come from generalized metrics. Amer. Math. Monthly, 95, pp. 89-97.
4. Arnold, A. and Nivat, M. (1980) The metric space of infinite trees: algebraic and topological properties. Fund. Inform., 3, pp. 445-476.
5. Arnold, A. and Nivat, M. (1980) Metric interpretations of infinite trees and semantics of non-deterministic recursive programs. Theoret. Comput. Sci., 11, pp. 181-205.
6. Albeverio, S., Khrennikov, A. and Kloeden, P. (1999) Memory retrieval as a p-adic dynamical system. Biosystems, 49, pp. 105-115. (Pubitemid 29073351)
7. Khrennikov, A. (1998) Human subconscious as the p-adic dynamical system. J. Theoret. Biology, 193, pp. 179-196. (Pubitemid 28396083)
8. Khrennikov, A. (2004) Information Dynamics in Cognitive, Psychological, Social and Anomalous Phenomena, Fundamental Theories of Physics, Vol. 138. Kluwer Academic Publishers, Dordrecht, Boston, London.
9. Murtagh, F. (2004) On ultrametricity, data coding, and computation. J. Classification, 21, pp. 167-184. (Pubitemid 40936640)
10. Murtagh, F. (2005) Identifying the ultrametricity of time series. Eur. Phys. J., 43, pp. 573-579.
11. Dragovich, B. and Dragovich, A. (2006). A p-dic model of DNA sequence and genetic code. http://www.arxiv.org/abs/q-bio. GN/0607018.
12. Khrennikov, A. and Kozyrev, S. V. (2007) Genetic codenext term on the diadic plane. Phys. A: Statist. Mech. Appl., 381, pp. 265-272. (Pubitemid 46829658)
13. de Bakker, J. and de Vink, E. (1996) Control Flow Semantics. Foundations of Computing Series. The MIT Press, Cambridge, Massachusetts.
14. Reed, G. M., Roscoe, A. W. and Wachter, R. F. (eds) (1991) Topology and Category Theory in Computer Science. Oxford University Press, Oxford, UK.
15. Flax, L. (1994) Using the Hamming Distance Between Logical Formulae to Examine Damage to an Artificial Neural Network. In Bozşahin, C., Halici, U., Oflazer, K. and Yalabik, N. (eds), Proc. 3rd Turkish Symp. Artificial Intelligence and Neural Networks, Ankara, Turkey, June, pp. 307-319. Middle East Technical University.
16. Stoltenberg-Hansen, V., Lindström, I. and Griffor, E. R. (1994) Mathematical Theory of Domains. Cambridge Tracts in Theoretical Computer Science, Vol. 22. Cambridge University Press, Cambridge, UK.
17. Lloyd, J. W. (1987) Foundations of Logic Programming, (2nd edn). Springer, Berlin.
18. Apt, K. R., Blair, H. A. and Walker, A. (1988) Towards a Theory of Declarative Knowledge. In Minker, J. (ed.), Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann Publishers Inc., Los Altos, CA.
19. Przymusinski, T. C. (1988) On the Declarative Semantics of Deductive Databases and Logic Programs. In Minker, J. (ed.), Foundations of Deductive Databases and Logic Programming, pp. 193-216. Morgan Kaufmann Publishers Inc., Los Altos, CA.
20. Batarekh, A. and Subrahmanian, V. (1989) Topological model set deformations in logic programming. Fund. Inf., 12, pp. 357-400.
21. Hitzler, P. and Seda, A. K. (1999) Acceptable Programs Revisited. In Etalle, S. and Smaus, J.-G. (eds), Proc. Workshop on Verification in Logic Programming, 16th Int. Conf. Logic Programming, ICLP'99, Las Cruces, New Mexico, November. Electronic Notes in Theoretical Computer Science, Vol. 30, pp. 59-76. Elsevier Science Publishers.
22. Hitzler, P. and Seda, A. K. (1999) Characterizations of Classes of Programs by Three-valued Operators. In Gelfond, M., Leone, N. and Pfeifer, G. (eds), Logic Programming, Non-monotonic Reasoning Proc. 5th Int. Conf. Logic Programming and Non-monotonic Reasoning, LPNMR'99, El Paso, Texas, USA, December. Lecture Notes in Artificial Intelligence, Vol. 1730, pp. 357-371. Springer, Berlin.
23. Hitzler, P. and Seda, A. K. (2003) Generalized metrics and uniquely determined logic programs. Theoret. Comput. Sci., 305, 187-219. Proc. Dagstuhl Seminar 00231, Topology in Computer Science: Constructivity; Asymmetry and Partiality; Digitalization, Schloss Dagstuhl, Germany, June, 2000.
24. Seda, A. K. (1995) Topology and the semantics of logic programs. Fund. Inf., 24, pp. 359-386.
25. Seda, A. K. and Hitzler, P. (1997) Topology and Iterates in Computational Logic. In Flagg, R., Hart, K., Norden, J., Tymchatyn, E. and Tuncali, M. (eds), Proc. 12th Summer Conf. General Topology and its Applications, Ontario, Canada, August. Topology Proceedings, Vol. 22, 1999, pp. 427-469. Auburn University, USA.
26. Seda, A. K. and Hitzler, P. (1998) Strictly Level-Decreasing Logic Programs. In Butterfield, A. and Flynn, S. (eds), Proc. Second Irish Workshop on Formal Methods, IWFM'98, NUI, Cork Ireland, July Electronic Worshops in Computing (eWiC), 1999, pp. 1-18. British Computer Society, Swindon, UK.
27. Fitting, M. (1994) Metric methods: Three examples and a theorem. J. Log. Program., 21, pp. 113-127.
28. Hitzler, P. and Seda, A. K. (1999) Multivalued Mappings, Fixed-Point Theorems and Disjunctive Databases. In Butterfield, A. and Flynn, S. (eds), Proc. 3rd Irish Workshop on Formal Methods, IWFM'99, NUI, Galway, Ireland, July. Electronic Workshops in Computing (eWiC), pp. 1-18. British Computer Society, Swindon, UK.
29. 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. (eds), Proc. Workshop on Logic Programming with Incomplete Information, vancouver, BC, Canada, October, pp. 58-73. University of British Columbia, Vancouver, BC.
30. Hitzler, P. and Seda, A. K. (1999) Some Issues Concerning Fixed Points in Computational Logic: Quasimetrics, Multivalued Mappings and the Knaster-Tarski Theorem. In Comfort, W. W., Heckmann, R., Kopperman, R. D. and Narici, L. (eds), Proc. 14th Summer Conf. General Topology and its Applications, Long Island, USA, August. Topology Proceedings, Vol. 24, pp. 223-250. Auburn University, USA.
31. Seda, A. K. (1997) Quasi-metrics and the semantics of logic programs. Fund. Inf., 29, pp. 97-117.
32. Davey, B. A. and Priestley, H. A. (2002) Introduction to Lattices and Order (2nd edn). Cambridge University Press, Cambridge, UK.
33. Ganter, B. and Wille, R. (1999) Formal Concept Analysis: Mathematical Foundations. Springer, Berlin.
34. Nachbin, L. (1965) Topology and Order, Mathematical Studies, Vol. 4. Van Nostrand, Princeton, NJ.
35. Joslyn, C. and Bruno, W. J. (2005) Weighted Pseudo Distances for Categorization in Semantic Hierarchies. In Dau, F., Mugnier, M.-L. and Stumme, G. (eds), Conceptual Structures: Common Semantics for Sharing Knowledge, Proc. 13th Int. Conf. Conceptual Structures, ICCS 2005, Kassel, Germany, July. Lecture Notes in Computer Science, Vol. 3596, pp. 381-395. Springer, Berlin.
36. Hitzler, P. (2004) Default Reasoning over Domains and Concept Hierarchies. In Biundo, S., Frühwirth, T. and Palm, G. (eds), KI2004: Advances in Artificial Intelligence. Proc. 27th Annual German Conf. AI, KI2004, Ulm, Germany, September. Lecture Notes in Artificial Intelligence, Vol. 3238, pp. 351-365. Springer.
37. Hitzler, P. and Krötzsch, M. (2006) Querying Formal Contexts with Answer Set Programs. In Schärfe, H., Hitzler, P. and Øhrstrø m, P. (eds), Conceptual Structures: Inspiration and Application, Proc. 14th International Conf. Conceptual Structures, ICCS 2006, Aalborg, Denmark, July 2006. Lecture Notes in Artificial Intelligence, Vol. 4068, pp. 413-426. Springer.
38. Apt, K. R. and Pedreschi, D. (1993) Reasoning about termination of pure Prolog programs. Inf. Comput., 106, pp. 109-157.
39. Flagg, B. and Kopperman, R. (1997) Continuity spaces: Reconciling domains and metric spaces. Theoret. Comput. Sci., 177, pp. 111-138. (Pubitemid 127454089)
40. Künzi, 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. and Lowen, R. (eds), Handbook of the History of General Topology, Vol. 3, pp. 853-968. Kluwer, Dordrecht.
41. Willard, S. (1970) General Topology. Addison-Wesley, Reading, MA.
42. Scott, D. S. (1982) Domains for denotational semantics. In Nielsen, M. and Schmidt, E. M. (eds), Automata, Languages and Programming, 9th Colloq., Proc., Aarhus, Denmark, mJuly. Lecture Notes in Computer Science, Vol. 140, pp. 577-613. Springer.
43. Bonsangue, M. M., Breugel, F. and Rutten, J. J. M. M. (1995) Generalized Ultrametric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. Technical report. Centrum voor Wiskunde en Informatica (CWI), Amsterdam, The Netherlands.
44. Smyth, M. B. (1987) Quasi Uniformities: Reconciling Domains with Metric Spaces. In Main, M. G., Melton, A., Mislove, M. W. and Schmidt, D. A. (eds), Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science, Vol. 198, Springer, Berlin, pp. 236-253.
45. Smyth, M. B. (1991) Totally Bounded Spaces and Compact Ordered Spaces as Domains of Computation. In Reed, G. M., Roscoe, A. W. and Wachter, R. F. (eds) Topology and Category Theory in Computer Science, pp. 207-229. Oxford University Press, Oxford, UK.
46. Baier, C.and Majster-Cederbaum, M. E. (1997) Metric semantics from partial order semantics. Acta Inform., 34, pp. 701-735. (Pubitemid 127360226)
47. Edalat, A. and Heckmann, R. (1998) A computational model for metric spaces. Theoret. Comput. Sci., 193, pp. 53-73. (Pubitemid 128451323)
48. Rutten, J. J. M. M. (1996) Elements of generalized ultrametric domain theory. Theoret. Comput. Sci., 170, pp. 349-381. Revised version of [49].
49. Rutten, J. J. M. M. (1995) Elements of Generalized Ultrametric Domain Theory. Technical Report CS-R9507. CWI, Stichting Mathematisch Centrum, Amsterdam, The Netherlands.
50. Priess-Crampe, S. and Ribenboim, P. (2000) Ultrametric spaces and logic programming. J. Log. Program., 42, pp. 59-70. (Pubitemid 32081818)
51. Priess-Crampe, S. and Ribenboim, P. (2000) Logic programming and ultrametric spaces. Rend. Math., VII, pp. 1-13.
52. Priess-Crampe, S. and Ribenboim, P. (1993) Fixed points, combs and generalized power series. Abh. Math. Sem. Univ. Hamburg., 63, pp. 227-244.
53. Bouamama, S., Misane, D. and Priess-Crampe, S. (2000) An Application of Ultrametric Spaces in Logic Programming. Proc. Sixth Maghrebian Conf. Computer Sciences, MCSEAI'2000, Fès, Morocco, November 1-3, pp. 1-5. Maghrebian Information Processing Society.
54. Hitzler, P. and Seda, A. K. (2002) The Fixed Point Theorems of Priess-Crampe and Ribenboim in Logic Programming. In Kuhlmann, F. V., Kuhlmann, S. and Marshall, M. (eds), Valuation Theory and its Applications, Proc. International Valuation Theory Conf., University of Saskatchewan in Saskatoon, Canada, July 1999. Fields Institute Communications Series, Vol. 32, pp. 219-235. American Mathematical Society, Providence, RI.
55. Matthews, S. G. (1986) Metric Domains for Completeness. Technical Report 76. Department of Computer Science, University of Warwick, Warwick. PhD Thesis, 1985.
56. Matthews, S. G. (1994) Partial Metric Topology. In Andima, S., Itzkowitz, G., Kong, Y., Kopperman, R., Misra, P., Narici, L. and Todd, A. (eds), Papers on General Topology and Applications: Eighth Summer Conf. General Topology and its Applications, Queens College, CUNY, NY, June. Annals of the New York Academy of Sciences, Vol. 728, pp. 183-197. New York Academy of Sciences.
57. Kahn, G. (1974) The Semantics of a Simple Language for Parallel Processing. Proc. IFIP Congress 74, Stockholm, August, pp. 471-475. Elsevier Science Publishers.
58. Heckmann, R. (1999) Approximation of metric spaces by partial metric spaces. Appl. Categ. Structures. 7, pp. 71-83. (Pubitemid 129579233)
59. O'Neill, S. J. (1996) Partial Metrics, Valuations, and Domain Theory. In Andima, S., Flagg, R., Itzkowitz, G., Kong, Y., Kopperman, R. and Misra, P. (eds), Papers on General Topology and Applications: Eleventh Summer Conf. General Topology and Applications, University of Southern Maine, ME, August. Annals of the New York Academy of Sciences. pp. 304-315. New York Academy of Sciences.
60. Matthews, S. G. (1992) The Cycle Contraction Mapping Theorem. Technical Report 228. Department of Computer Science, University of Warwick, Warwick.
61. Hitzler, P. and Seda, A. K. (2000) Dislocated topologies. J. Electr. Eng., 51, pp. 3-7. Proc. 2nd Slovakian Conf. Applied Mathematics, Bratislava. Slovak Academy of Sciences.
62. Sarma, R. D. (2007) Relational Topology. Preprint, Department of Mathematics, University of Delhi, India.
63. Apt, K. R., Marek, V. W., Truszczýnski, M. and Warren, D. S. (eds) (1999) The Logic Programming Paradigm: A 25-Year Perspective. Springer, Berlin.
64. van Gelder, A., Ross, K. A. and Schlipf, J. S. (1991) The well-founded semantics for general logic programs. J. ACM, 38, pp. 620-650.
65. Gelfond, M. and Lifschitz, V. (1991) Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, pp. 365-385.
66. Fitting, M. (1985) A Kripke-Kleene semantics for general logic programs. J. Log. Program., 2, pp. 295-312. (Pubitemid 16456940)
67. Apt, K. R. and van Emden, M. H. (1982) Contributions to the theory of logic programming. JACM, 29, pp. 841-862.
68. Kowalski, R. A. (1974) Predicate Logic as a Programming Language. In Rosenfeld, J. (ed.), Proc. IFIP'74, Stockholm, Sweden, August, pp. 569-574. North-Holland, Amsterdam.
69. Clark, K. L. (1978) Negation as failure. In Gallaire, H. and Minker, J. (eds), Logic and Data Bases, pp. 293-322. Plenum Press, New York.
70. Kuhlmann, F., Kuhlmann, S. and Marshall, M. (eds) (2002) Valuation Theory and its Applications, Proc. Int. Valuation Theory Conf., University of Saskatchewan in Saskatoon, Canada, July, 1999. Fields Institute Communications Series, Vol. 32. American Mathematical Society, Providence, RI.
71. Ribenboim, P. (1996) The new theory of ultrametric spaces. Period. Math. Hungar., 32, pp. 103-111.
72. Delon, F. (1984) Espaces ultramétriques. J. Symbolic Logic, 49, pp. 405-424.
73. Cavedon, L. (1989) Continuity, Consistency, and Completeness Properties for Logic Programs. In Levi, G. and Martelli, M. (eds), Proc. 6th Int. Conf. Logic Programming, June, Portugal, pp. 571-584. MIT Press, Cambridge, MA.
74. Cavedon, L. (1991) Acyclic programs and the completeness of SLDNF-resolution. Theoret. Comput. Sci., 86, pp. 81-92.
75. deBakker, J. and deVink, E. (1996) A Metric ApproachtoControl Flow Semantics. In Andima, S., Flagg, R., Itzkowitz, G., Kong, Y., Kopperman, R. and Misra, P. (eds), Papers on General Topology and Applications: Eleventh Summer Conference on General Topology and Applications, University of Southern Maine, ME, August. Annals of the New York Academy of Sciences, pp. 11-27. New York Academy of Sciences.
76. Edalat, A. and Smyth, M. B. (1992) Compact Metric Information Systems. In de Bakker, J., de Roever, W.-P. and Rozenberg, G. (eds), Semantics: Foundations and Applications. Proc. REX Workshop, Beekbergen, The Netherlands, June. Lecture Notes in Computer Science, Vol. 666, pp. 154-173. Springer, Berlin.
77. Bader, S., Hitzler, P. and Hölldobler, S. (2006) The integration of connectionism and first-order knowledge representation and reasoning as a challenge for artificial intelligence. Information, 9. Invited paper.
78. Hitzler, P., Hölldobler, S. and Seda, A. K. (2004) Logic programs and connectionist networks. J. Appl. Logic, 2, pp. 245-272. (Pubitemid 40009289)
79. Seda, A. K. (2006) On the Integration of Connectionist and Logic-Based Systems. In Hurley, T., an Airchinnigh, M. M., Schellekens, M., Seda, A. K. and Strong, G. (eds), Proc. 4th Irish Conf. on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT'2004), Trinity College Dublin, Ireland, July. Electronic Notes in Theoretical Computer Science (ENTCS), Vol. 161, pp. 109-130. Elsevier Science Publishers.
80. Hitzler, P. (2005) Towards a systematic account of different semantics for logic programs. J. Logic Comput., 15, pp. 391-404. (Pubitemid 40860581)
81. Hitzler, P. and Wendt, M. (2005) A uniform approach to logic programming semantics. Theory Pract. Log. Program., 5, pp. 123-159.
82. Schellekens, M. (1995) The Smyth Completion: A Common Foundation for Denotational Semantics and Complexity Analysis. In Brookes, S., Main, M., Melton, A. and Mislove, M. (eds), Proc. MFPS 11, Tulane University, New Orleans, USA, March, Electronic Notes in Theoretical Computer Science, Vol. 1, pp. 211-232. Elsevier Science Publishers.
83. Romaguera, S. and Schellekens, M. (2003) Norm-Weightable Riesz Spaces and the Dual Complexity Space. In Hurley, T., an Airchinnigh, M. M., Schellekens, M. and Seda, A. K. (eds), Proc. 2nd Irish Conf. Mathematical Foundations of Computer Science and Information Technology (MFCSIT'2002), Galway, Ireland, July. Electronic Notes in Theoretical Computer Science, Vol. 74, pp. 1-17. Elsevier Science Publishers.
84. Crazzolara, F. (1997) Quasi-Metric Spaces as Domains for Abstract Interpretation. In Falaschi, M., Navarro, M. and Policriti, A. (eds), Proc. 1997 Joint Conf. Declarative Programming, APPIA-GULP-PRODE'97, Grado, Italy, June, pp. 45-56. University of Udine, Italy.'
85. Castro-Company, F., Romaguera, S., Sánchez-Alvarez, J. and Tirado, P. (2007) A Quasi-Metric Lattice Approach for Access Prediction in Replicated Database Protocols. Technical Report. Instituto de Matemática Pura y Aplicada, Universidad Politécnica de Valencia, Spain.
86. Rodríguez-López, J., Romaguera, S. and Valero, O. (2007) Denotational semantics for programming languages, balanced quasi-metrics and fixed points. Int. J. Comput. Math., to appear.
87. Waszkiewicz, P. (2002) Quantitative Continuous Domains. PhD Thesis, School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK.
88. Waszkiewicz, P. (2003) Quantitative continuous domains. Appl. Categ. Struct., 11, pp. 41-67.
89. Krötzsch, M. (2006) Generalized ultrametric spacesinquantitative domain theory. Theoret. Comput. Sci., 368, pp. 30-49.
90. Martin, K. (2000) A Foundation for Computation. PhD Thesis, Department of Mathematics, Tulane University New Orleans, LA 70118, USA.
91. Schellekens, M. (2003) A characterization of partial metrizability: Domains are quantifiable. Theoret. Comput. Sci., 305, pp. 409-432.
92. Schellekens, M. (2004) The correspondence between partial metrics and semi-valuations. Theoret. Comput. Sci., 315, pp. 135-149.
93. Künzi, H.-P. A., Pajoohesh, H. and Schellekens, M. (2006) Partial quasi-metrics. Theoret. Comput. Sci., 365, pp. 237-246.
94. Bukatin, M. A. (2002) Mathematics of Domains. PhD Thesis, Brandeis University Waltham, MA, USA.
95. Kozen, D. (1981) Semantics of probabilistic programs. J. Comput. Syst. Sci., 22, pp. 328-350.
96. Bukatin, M. A. and Scott, J. S. (1997) Towards Computing Distances Between Programs via Scott Domains. In Adian, S. and Nerode, A. (eds), Logical Foundations of Computer Science, 4th Int. Symp., LFCS'97 Proc., Yaroslavl, Russia, July. Lecture Notes in Computer Science, Vol. 1234, pp. 33-43. Springer, London.
97. 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. (eds), Proc. 6th Int. Workshop in Formal Methods (IWFM'03), Dublin City University, Dublin, Ireland, July. Electronic Workshops in Computing (eWiC), pp. 1-15. British Computer Society, Swindon.