activity
20112023
most citedAdvances in Learning Bayesian Networks of Bounded Treewidth

23 citations · 85 across the 13 of their papers we have counts for

collaborators

13 papers

cs.AI2023

dPASP: A Comprehensive Differentiable Probabilistic Answer Set Programming Environment For Neurosymbolic Learning and Reasoning

Renato Lui Geh, Jonas Gonçalves, Igor Cataneo Silveira +2

We present dPASP, a novel declarative probabilistic logic programming framework for differentiable neuro-symbolic reasoning. The framework allows for the specification of discrete…

cs.AI2022★ 5 cited

The BLue Amazon Brain (BLAB): A Modular Architecture of Services about the Brazilian Maritime Territory

Paulo Pirozelli, Ais B. R. Castro, Ana Luiza C. de Oliveira +19

We describe the first steps in the development of an artificial agent focused on the Brazilian maritime territory, a large region within the South Atlantic also known as the Blue A…

cs.CL2022★ 6 cited

Integrating question answering and text-to-SQL in Portuguese

Marcos Menon José, Marcelo Archanjo José, Denis Deratani Mauá +1

Deep learning transformers have drastically improved systems that automatically answer questions in natural language. However, different questions demand different answering techni…

cs.AI2020★ 2 cited

Tractable Inference in Credal Sentential Decision Diagrams

Lilith Mattei, Alessandro Antonucci, Denis Deratani Mauá +2

Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. They allow for a compact representation of…

cs.AI2017★ 2 cited

Speeding-up ProbLog's Parameter Learning

Francisco H. O. V. de Faria, Arthur C. Gusmão, Fabio G. Cozman +1

ProbLog is a state-of-art combination of logic programming and probabilities; in particular ProbLog offers parameter learning through a variant of the EM algorithm. However, the re…

cs.AI2017★ 10 cited

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks

Diarmaid Conaty, Denis D. Mauá, Cassio P. de Campos

We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction fro…