Learning the Parameters of Probabilistic Answer Set Programs

Probabilistic Answer Set Programming (PASP) is a powerful formalism that allows to model uncertain scenarios with answer set programs. One of the possible semantics for PASP is the credal semantics, where a query is associated with a probability interval rather than a sharp probability value. In this paper, we extend the learning from interpretations task, usually considered for Probabilistic Logic Programming, to PASP: the goal is, given a set of (partial) interpretations, to learn the parameters of a PASP program such that the product of the lower bounds of the probability intervals of the interpretations is maximized. Experimental results show that the execution time of the algorithm is heavily dependent on the number of parameters rather than on the number of interpretations.