Proceedings

Most Probable Explanation in Probabilistic Answer Set Programming

Download BibTeX Cite

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 9049-9057.

https://doi.org/10.24963/ijcai.2025/1006

Abstract

Most Probable Explanation (MPE) is a fundamental problem in statistical relational artificial intelligence.

In the context of Probabilistic Answer Set Programming (PASP), solving MPE is still an open research problem.

In this paper, we present three novel approaches for solving the MPE task in PASP that are based on: i) Algebraic Model Counting, ii) Answer Set Programming (ASP), and iii) ASP with quantifiers (ASP(Q)).

These approaches are implemented and evaluated against existing solvers across different datasets and configurations.

Empirical results demonstrate that the novel solutions consistently outperform existing alternatives for non-stratified programs.

Damiano Azzolini, Giuseppe Mazzotta, Francesco Ricca, and Fabrizio Riguzzi. 2025. Most Probable Explanation in Probabilistic Answer Set Programming. In Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-25. IJCAI, 9049–9057. https://doi.org/10.24963/ijcai.2025/1006
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards