Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Acyclic logic programs and the completeness of SLDNF-resolution
Theoretical Computer Science
Topology, computer science, and the mathematics of convergence
Topology and category theory in computer science
Totally bounded spaces and compact ordered spaces as domains of computation
Topology and category theory in computer science
Strong termination of logic programs
Journal of Logic Programming
Handbook of logic in computer science (vol. 1)
Reasoning about termination of pure Prolog programs
Information and Computation
Topological characterizations for logic programming semantics
Topological characterizations for logic programming semantics
Continuity spaces: reconciling domains and metric spaces
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
The Query Topology in Logic Programming
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Quasi Uniformities: Reconciling Domains with Metric Spaces
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Generalized ultrametric spaces: completion, topology, and powerdomains via the Yoneda embedding
Generalized ultrametric spaces: completion, topology, and powerdomains via the Yoneda embedding
Elements of generalized ultrametric domain theory
Elements of generalized ultrametric domain theory
Topology And The Semantics Of Logic Programs
Fundamenta Informaticae
Disjunctive Signed Logic Programs
Fundamenta Informaticae
On quasi-metric aggregation functions and fixed point theorems
Fuzzy Sets and Systems
| Hi-index | 0.00 |
Quasi-metrics have been used in several places in the literature on domain theory and the formal semantics of programming languages. In this paper, we consider the role of quasi-metrics in the fixed point semantics of logic programs, examining in detail a quite general process by which fixed points of immediate consequence operators can be found. This work takes as its starting point: (i) Fitting's recent application of the Banach contraction mapping theorem in logic programming; (ii) a theorem of Rutten which generalizes both the contraction mapping theorem and the Knaster-Tarski theorem; (iii) Smyth's work on totally bounded spaces and compact ordered spaces as domains of computation. Our results therefore are theoretical and to be viewed as a contribution to the mathematical foundations of computer science.