A top-k query answering procedure for fuzzy logic programming

We present a top-k query answering procedure for Fuzzy Logic Programming, in which arbitrary computable functions may appear in the rule bodies to manipulate truth values. The top-k ranking problem, i.e. determining the top k answers to a query, becomes important as soon as the set of facts becomes quite large.