Management of Uncertainty Orderings through ASP

In this paper we exploit Answer Set Programming (ASP) to formalize (and reason about) uncertainty expressed by belief orderings. The availability of ASP-solvers supports the design of automated tools to handle such formalizations. Our proposal reveals particularly suitable whenever the domain of discernment is “partial”, i.e. it does not represent a closed world but just the relevant part of a problem. We first illustrate how to automatically “classify”, according to the most well-known uncertainty frameworks, any given partial qualitative uncertainty assessment. Then, we show how to compute the enlargement of an assessment to any other new inference target, with respect to a fixed (admissible) qualitative framework.