Author:
Azzolini Damiano,Riguzzi Fabrizio
Abstract
AbstractProbabilistic Answer Set Programming under the credal semantics (PASP) describes an uncertain domain through an answer set program extended with probabilistic facts. The PASTA language leverages PASP to express statistical statements. A solver with the same name allows to perform inference in PASTA programs and, in general, in PASP. In this paper, we investigate inference in PASP, propose a new inference algorithm called aspcs based on Second Level Algebraic Model Counting (2AMC), and implement it into the aspmc solver. Then, we compare it with PASTA on a set of benchmarks: the empirical results show that, when the program does not contain aggregates, the new algorithm outperforms PASTA. However, when we consider PASTA statements and aggregates, we need to replace aggregates with a possibly exponential number of rules, and aspcs is slower than PASTA.
Publisher
Springer Nature Switzerland
Reference23 articles.
1. Alviano, M., Faber, W.: Aggregates in answer set programming. KI-Künstliche Intelligenz 32(2), 119–124 (2018). https://doi.org/10.1007/s13218-018-0545-9
2. Azzolini, D.: A brief discussion about the credal semantics for probabilistic answer set programs. In: Arias, J., et al. (eds.) Proceedings of the International Conference on Logic Programming 2023 Workshops co-located with the 39th International Conference on Logic Programming (ICLP 2023). CEUR Workshop Proceedings, vol. 3437, pp. 1–13. CEUR-WS.org (2023)
3. Lecture Notes in Computer Science;D Azzolini,2022
4. Lecture Notes in Computer Science;D Azzolini,2023
5. Bellodi, E., Alberti, M., Riguzzi, F., Zese, R.: MAP inference for probabilistic logic programming. Theory Pract. Logic Program. 20(5), 641–655 (2020). https://doi.org/10.1017/S1471068420000174
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献