Denis Deratani Mauá

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 …

Scalable Learning of Probabilistic Circuits

2023

Probabilistic circuits (PCs) are a family of tractable probabilistic models capable of answering a wide range of queries exactly and in polytime. While inference is usually straightforward, learning PCs that both obey the needed restrictions …