Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of information. Based on this semantics, we develop efficient algorithms that can answer queries for non-ground programs with the help of an SLD-like procedure. We also analyze the computational complexity of the algorithms and illustrate their uses.