An Algebraic Approach to Weighted Answer-set Programming
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917969438703616 |
|---|---|
| author | Coelho, Francisco Dinis, Bruno Seipel, Dietmar Abreu, Salvador |
| author_facet | Coelho, Francisco Dinis, Bruno Seipel, Dietmar Abreu, Salvador |
| contents | 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 (eg probabilities) of an ASP to its standard 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20849 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Algebraic Approach to Weighted Answer-set Programming Coelho, Francisco Dinis, Bruno Seipel, Dietmar Abreu, Salvador Logic in Computer Science Programming Languages Symbolic Computation 68M01 D.3.1 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 (eg probabilities) of an ASP to its standard 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. |
| title | An Algebraic Approach to Weighted Answer-set Programming |
| topic | Logic in Computer Science Programming Languages Symbolic Computation 68M01 D.3.1 |
| url | https://arxiv.org/abs/2503.20849 |