Quasi-metrics and the semantics of logic programs

Fundamenta Informaticae

Volumn 29, Issue 1-2, 1997, Pages 97-117

  Seda, Anthony Karel ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; PROGRAMMING THEORY;

BANACH CONTRACTION MAPPING THEOREM; COMPACT ORDERED SPACES; KNASTER-TARSKI THEOREM; QUASI METRICS; SEMANTICS; TOTALLY BOUNDED SPACES;

LOGIC PROGRAMMING;

EID: 0030778243     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-291205     Document Type: Article

References (32)

1. F. Alessi, P. Baldan, G. Bellè and J.J.M.M. Rutten, Solutions of Functorial and Non-Functorial Metric Domain Equations, Electronic Notes in Theoretical Computer Science 1 (1995), to appear.
2. P. America and J.J.M.M. Rutten, Solving Reflexive Domain Equations in a Category of Complete Metric Spaces, Journal of Computer and System Sciences 39 (1989) 343-375.
3. K.R. Apt, H.A. Blair and A. Walker, Towards a Theory of Declarative Knowledge. In: Jack Minker (Ed.), Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers Inc., Los Altos, 1988, pp. 89-148.
4. K.R. Apt and D. Pedreschi, Studies in Pure Prolog: Termination. In: J.W. Lloyd (Ed.), Symposium on Computational Logic. Springer-Verlag, 1990, pp. 150-176.
5. K.R. Apt and D. Pedreschi, Reasoning About Termination of Pure Prolog Programs, Information and Computation 106 (1) (1993) 109-157.
6. A. Arnold and M. Nivat, The Metric Space of Infinite Trees: Algebraic and Topological Properties, Fundamenta Informaticae III (4) (1980) 445-476.
7. M.M. Bonsangue, F. van Breugel and J.J.J.M. Rutten, Generalized Ultrametric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. Technical Report CS-R9560, Centrum voor Wiskunde en Informatica, Amsterdam, September, 1995. [Available via FTP at ftp.cwi.nl in directory pub/CWIreports/AP/CS-R9560.ps.gz]
8. A. Batarekh and V.S. Subrahmanian, Semantical Equivalences of (Non Classical) Logic Programs. In: K. Bowen and R. Kowalski (Eds.), Proc. 5th Intl. Conference on Logic Programming. MIT Press, 1988, pp. 960-977.
9. A. Batarekh and V.S. Subrahmanian, The Query Topology in Logic Programming. In: Proc. 1989 Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 349, Springer-Verlag, 1989, pp. 375-387.
10. A. Batarekh and V.S. Subrahmanian, Topological Model Set Deformations in Logic Programming, Fundamenta Informaticae XII (3) (1989) 357-400.
11. M. Bezem, Characterizing Termination of Logic Programs with Level Mappings. In: E.L. Lusk and R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming. MIT Press, 1989, pp. 69-80.
12. M. Bezem, Strong Termination of Logic Programs, J. Logic Programming 15 (1993) 79-97.
13. L. Cavedon, Continuity, Consistency, and Completeness Properties for Logic Programs. In: G. Levi and M. Martelli (Eds.), Proc. Sixth International Conference on Logic Programming. MIT Press, 1989, pp. 571-584.
14. L. Cavedon, Acyclic Logic Programs and the Completeness of SLDNF-resolution, Theoretical Computer Science 86 (1991) 81-92.
15. A.P. Ferry, Topological Characterizations for Logic Programming Semantics. Ph.D. Thesis, University of Michigan, 1994.
16. M. Fitting, Metric Methods: Three Examples and a Theorem, J. Logic Programming 21 (3) (1994) 113-127.
17. R.C. Flagg and R. Kopperman, Fixed Points and Reflexive Domain Equations in Categories of Continuity Spaces, Electronic Notes in Theoretical Computer Science 1 (1995), to appear.
18. R.C. Flagg and R. Kopperman, Continuity Spaces: Reconciling Domains and Metric Spaces, Theoretical Computer Science, to appear.
19. M. Gelfond and V. Lifschitz, Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 9 (1991) 365-385.
20. M. A. Khamsi, V. Kreinovich and D. Misane, A New Method of Proving the Existence of Answer Sets for Disjunctive Logic Programs: A Metric Fixed Point Theorem For Multi-Valued Mappings. Proceedings of the Workshop on Logic Programming with Incomplete Information, Vancouver, B.C., Canada, October 1993, pp. 58-73. [Also obtainable as a Technical Report via FTP from the Department of Computer Science, University of Texas at El Paso, 1994].
21. J.W. Lloyd, Foundations of Logic Programming. Springer-Verlag, 2nd Edition, Berlin, 1988.
22. A.W. Roscoe, Topology, Computer Science, and the Mathematics of Convergence. In: G.M. Reed, A.W. Roscoe and R.F. Wachter (Eds.), Topology and Category Theory in Computer Science. Oxford University Press, 1991, pp. 1-27.
23. J.J.M.M. Rutten, Elements of Generalized Ultrametric Domain Theory. Technical Report CS-R9507, Centrum voor Wiskunde en Informatica, Amsterdam, 1995. [Available via FTP at ftp.cwi.nl in directory pub/CWIreports/AP/CS-R9507.ps.gz].
24. J.J.M.M. Rutten, Elements of Generalized Ultrametric Domain Theory. Technical Report, Centrum voor Wiskunde en Informatica, Amsterdam, 1996.
25. [Revised version of [23], to appear in Theoretical Computer Science].
26. A.K. Seda, Some Applications of General Topology to the Semantics of Logic Programs, Bull. European Association for Theoretical Computer Science 52 (1994) 279-292.
27. A.K. Seda, A Topological View of the Kowalski-van Emden Theorem, Bull. European Association for Theoretical Computer Science 53 (1994) 256-263.
28. A.K. Seda, Topology and the Semantics of Logic Programs, Fundamenta Informaticae 24 (4) (1995) 359-386.
29. M.B. Smyth, Quasi Uniformities: Reconciling Domains with Metric Spaces. In: M. Main, A. Melton, M. Mislove and D. Schmidt (Eds.), Mathematical Foundations of Programming Language Semantics. Lecture Notes in Computer Science, Vol. 298, Springer-Verlag, 1987, pp. 236-253.
30. M.B. Smyth, Totally bounded spaces and compact ordered spaces as domains of computation. In: G.M. Reed, A.W. Roscoe and R.F. Wachter (Eds.), Topology and Category Theory in Computer Science. Oxford University Press, 1991, pp. 207-229.
31. M.B. Smyth, Topology. In: S. Abramsky, D.M. Gabbay and T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science Vol. 1. Oxford Science Publications, Oxford University Press, 1992, pp. 641-761.
32. S. Willard, General Topology. Addison Wesley Series in Mathematics, Addison Wesley Publishing Company Inc., Massachusetts, 1970.