Fábio Gagliardi Cozman

Complexity results for probabilistic answer set programming

2019 · International Journal of Approximate Reasoning

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 …