Abstract
A continuous predicate on a domain, or more generally a topological space, can be concretely described as an open or closed set, or less obviously, as the set of all predicates consistent with it. Generalizing this scenario to quantitative predicates, we obtain under certain well-understood hypotheses an isomorphism between continuous functions on points and supremum preserving functions on open sets, both with values in a fixed lattice. The functions on open sets provide a topological foundation for possibility theories in Artificial Intelligence, revealing formal analogies of quantitative predicates with continuous valuations. Three applications of this duality demonstrate its usefulness: we prove a universal property for the space of quantitative predicates, we characterize its inf-irreducible elements, and we show that bicontinuous lattices and Scott-continuous maps form a cartesian closed category.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1–168. Clarendon Press, 1994.
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. ACompendium of Continuous Lattices. Springer Verlag, 1980.
P. R. Halmos. Measure Theory. D. van Norstrand Company, 1950.
R. Heckmann. Power domains and second order predicates. Theoretical Computer Science, 111:59–88, 1993.
M. Huth and M. Kwiatkowska. Quantitative Analysis and Model Checking. Annual IEEE Symposium on Logic in Computer Science, pages 111–122. IEEE Computer Society Press, June 1997.
C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Logic in Computer Science, pages 186–195. IEEE Computer Society Press, 1989.
C. Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edinburgh, 1990. Also published as Technical Report No. CST-63-90.
C. Morgan, A. McIver, K. Seidel, and J.W. Sanders. Probabilistic Predicate Transformers. Technical Report PRG-TR-4-95, Oxford University Computing Laboratory, 1995.
C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325–353, May 1996.
C. Morgan and A. McIver. An expectation-transformer model for probabilistic temporal logic. Technical report, Computing Laboratory, Oxford University, April 1997. Draft. Personal Communication.
G. N. Raney. Completely distributive complete lattices. Proc. AMS, 3:667–680, 1952.
G. N. Raney. Tight Galois connections and complete distributivity. Trans. AMS, 97:418–426, 1960.
M. B. Smyth. Powerdomains and predicate transformers: a topological view. In J. Diaz, editor, Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science, pages 662-675. Springer Verlag, 1983.
Wim Vervaat. Random upper semicontinuous functions and extremal processes. In W. Vervaat and H. Holwerda, editors, Probability and Lattices, pages 1–56. CWI Tracts, 1991.
S. J. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heckmann, R., Huth, M. (1998). A duality theory for quantitative semantics. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028019
Download citation
DOI: https://doi.org/10.1007/BFb0028019
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64570-2
Online ISBN: 978-3-540-69353-6
eBook Packages: Springer Book Archive