Author(s): Dinis, Bruno ; Coelho, Francisco ; Abreu, Salvador ; Seipel, Dietmar
Date: 2025
Persistent ID: http://hdl.handle.net/10174/39151
Origin: Repositório Científico da Universidade de Évora
Subject(s): Answer-Set Programming; Stable Models; Probabilistic Logic Programming
Logic programs, more specifically, answer-set programs, can be annotated with probabilities on facts to express uncertainty. We address the problem of propagating weight annotations on facts (e.g. probabilities) of an answer-set program to its stable models, and from there to events (defined as sets of atoms) in a dataset over the program’s domain. We propose a novel approach which is algebraic in the sense that it relies on an equivalence relation over the set of events. Uncertainty is then described as polynomial expressions over variables. We propagate the weight function in the space of models and events, rather than doing so within the syntax of the program. As evidence that our approach is sound, we show that certain facts behave as expected. Our approach allows us to investigate weight annotated programs and to determine how suitable a given one is for modeling a given dataset containing events. It’s core is illustrated by a running example and the encoding of a Bayesian network.
