# Complexity results for probabilistic answer set programming

Denis Deratani Mauá, Fabio Gagliardi Cozman

Resultado de la investigación: Contribución a una revistaArtículo

1 Cita (Scopus)

### Resumen

© 2019 Elsevier Inc. We analyze the computational complexity of probabilistic logic programming with constraints, disjunctive heads, and aggregates such as sum and max. We consider propositional programs and relational programs with bounded-arity predicates, and look at cautious reasoning (i.e., computing the smallest probability of an atom over all probability models), cautious explanation (i.e., finding an interpretation that maximizes the lower probability of evidence) and cautious maximum-a-posteriori (i.e., finding a partial interpretation for a set of atoms that maximizes their lower probability conditional on evidence) under Lukasiewicz's credal semantics.
Idioma original Inglés estadounidense 133-154 22 International Journal of Approximate Reasoning https://doi.org/10.1016/j.ijar.2019.12.003 Publicada - 1 mar 2020 Sí