a characterization of partial metrizability: domains are quantifiable. a characterization of partial metrizability is given which provides a partial solution to an open problem stated by künzi in the survey paper non-symmetric topology (in: proceedings of the szekszard conference, bolyai soc. math. studies, vol. 4, 1993, pp. 303-338; problem 7 ). the characterization yields a powerful tool which establishes a correspondence between partial metrics and special types of valuations, referred to as q-valuations (cf. also theoret. comput. sci., to appear). the notion of a q-valuation essentially combines the well-known notion of a valuation with a weaker version of the notion of a quasi-unimorphism, i.e. an isomorphism in the context of quasi-uniform spaces. as an application, we show that ω-continuous directed complete partial orders (dcpos) are quantifiable in the sense of o'neill (in: s. andima et al. (eds.), proceedings of the 11th summer conference on general topology and applications, annals of the new york academy of sciences, vol. 86, 1997, pp. 304-315), i.e. the scott topology and partial order are induced by a partial metric. for ω-algebraic dcpos the lawson topology is induced by the associated metric. the partial metrization of general domains improves prior gpproaches in two ways: • the partial metric is guaranteed to capture the scott topology as opposed to e.g. smyth (quasi-uniformities: reconciling domains with metric spaces, lecture notes in computer science, vol. 298, springer, berlin, 1987, pp. 236-253), bonsangue et al. (theoret. comput. sci. 193 (1998) 1), flagg (theoret. comput. sci., to appear) and flagg (theoret. comput. sci. 177 (1) (1997) 1), which in general yield a coarser topology. • partial metric spaces are smyth-completable and hence their smyth-completion reduces to the standard bicompletion. this type of simplification is advocated in smyth (in: g.m. reed, a.w. roscoe, r.f. wachter (eds.), topology and category theory in computer science, oxford university press, oxford, 1991, pp. 207-229). our results extend smyth (1991)'s scope of application from the context of 2/3 sfp domains to general domains.the quantification of general domains solves an open problem on the partial metrizability of domains stated in o'neil (1997) and heckmann (appl. categor. struct. (1999) 71 ).our proof of the quantifiability of domains is novel in that it relies on the central notion of a semivaluation (schellekens, the correspondence between partial metrics and semivaluations, theoret. comput. sci., to appear). the characterization of partial metrizability is entirely new and sheds light on the deeper connections between partial metrics and valuations commented on in [bukatin and shorina (in: m. nivat (ed.), foundations of software science and computation structures, lecture notes in computer science, vol. 1378, springer, berlin, 1998, pp. 125-139)]. based on (schellekens, the correspondence between partial metrics and semivaluations, theoret. comput. sci., to appear) and our present characterization, we conclude that the notion of a (semi)valuation is central in the context of quantitative domain theory since it can be shown to underlie the various mode s arising in the applications.