Denis Deratani Mauá

Orcid: 0000-0003-2297-6349

According to our database1, Denis Deratani Mauá authored at least 69 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A New Benchmark for Automatic Essay Scoring in Portuguese.
Proceedings of the 16th International Conference on Computational Processing of Portuguese, 2024

2023
dPASP: A Comprehensive Differentiable Probabilistic Answer Set Programming Environment For Neurosymbolic Learning and Reasoning.
CoRR, 2023

Specifying credal sets with probabilistic answer set programming.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2023

Assessing Good, Bad and Ugly Arguments Generated by ChatGPT: a New Dataset, its Methodology and Associated Tasks.
Proceedings of the Progress in Artificial Intelligence, 2023

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

Integrating Question Answering and Text-to-SQL in Portuguese.
Proceedings of the Computational Processing of the Portuguese Language, 2022

Exploration Versus Exploitation in Model-Based Reinforcement Learning: An Empirical Study.
Proceedings of the Intelligent Systems - 11th Brazilian Conference, 2022

2021
Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget.
Int. J. Approx. Reason., 2021

Special Issue on Robustness in Probabilistic Graphical Models.
Int. J. Approx. Reason., 2021

Learning probabilistic sentential decision diagrams under logic constraints by sampling and averaging.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Cautious Classification with Data Missing Not at Random Using Generative Random Forests.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

2020
Thirty years of credal networks: Specification, algorithms and complexity.
Int. J. Approx. Reason., 2020

Complexity results for probabilistic answer set programming.
Int. J. Approx. Reason., 2020

Tractable inference in credal sentential decision diagrams.
Int. J. Approx. Reason., 2020

Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks.
Int. J. Approx. Reason., 2020

The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference.
Int. J. Approx. Reason., 2020

Two Reformulation Approaches to Maximum-A-Posteriori Inference in Sum-Product Networks.
Proceedings of the International Conference on Probabilistic Graphical Models, 2020

Decision-Aware Model Learning for Actor-Critic Methods: When Theory Does Not Meet Practice.
Proceedings of the "I Can't Believe It's Not Better!" at NeurIPS Workshops, 2020

On the Performance of Planning Through Backpropagation.
Proceedings of the Intelligent Systems - 9th Brazilian Conference, 2020

Finding Feasible Policies for Extreme Risk-Averse Agents in Probabilistic Planning.
Proceedings of the Intelligent Systems - 9th Brazilian Conference, 2020

Efficient Predictive Uncertainty Estimators for Deep Probabilistic Models.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Speeding up parameter and rule learning for acyclic probabilistic logic programs.
Int. J. Approx. Reason., 2019

The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws.
Int. J. Approx. Reason., 2019

Robust Analysis of MAP Inference in Selective Sum-Product Networks.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

Deep Reactive Policies for Planning in Stochastic Nonlinear Domains.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Robustifying sum-product networks.
Int. J. Approx. Reason., 2018

The complexity of Bayesian networks specified by propositional and relational languages.
Artif. Intell., 2018

The Finite Model Theory of Bayesian Networks: Descriptive Complexity.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When a Robot Reaches Out for Human Help.
Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2018, 2018

Advances in Automatically Solving the ENEM.
Proceedings of the 7th Brazilian Conference on Intelligent Systems, 2018

2017
On the Semantics and Complexity of Probabilistic Logic Programs.
J. Artif. Intell. Res., 2017

The effect of combination functions on the complexity of relational Bayesian networks.
Int. J. Approx. Reason., 2017

On the complexity of propositional and relational credal networks.
Int. J. Approx. Reason., 2017

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks.
CoRR, 2017

Speeding-up ProbLog's Parameter Learning.
CoRR, 2017

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization.
Proceedings of the Scalable Uncertainty Management - 11th International Conference, 2017

Credal Sum-Product Networks.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

Modeling Markov Decision Processes with Imprecise Probabilities Using Probabilistic Logic Programming.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

The Complexity of Inferences and Explanations in Probabilistic Logic Programming.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

The Descriptive Complexity of Bayesian Network Specifications.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

University Entrance Exam as a Guiding Test for Artificial Intelligence.
Proceedings of the 2017 Brazilian Conference on Intelligent Systems, 2017

On Using Sum-Product Networks for Multi-label Classification.
Proceedings of the 2017 Brazilian Conference on Intelligent Systems, 2017

2016
Better Initialization Heuristics for Order-based Bayesian Network Structure Learning.
J. Inf. Data Manag., 2016

Hidden Markov models with set-valued parameters.
Neurocomputing, 2016

Fast local search methods for solving limited memory influence diagrams.
Int. J. Approx. Reason., 2016

Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams.
Int. J. Approx. Reason., 2016

Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity.
Proceedings of the Probabilistic Graphical Models - Eighth International Conference, 2016

The Structure and Complexity of Credal Semantics.
Proceedings of the 3rd International Workshop on Probabilistic Logic Programming co-located with 26th International Conference on Inductive Logic Programming (ILP 2016), 2016

Markov Decision Processes Specified by Probabilistic Logic Programming: Representation and Solution.
Proceedings of the 5th Brazilian Conference on Intelligent Systems, 2016

2015
DL-Lite Bayesian Networks: A Tractable Probabilistic Graphical Model.
Proceedings of the Scalable Uncertainty Management - 9th International Conference, 2015

The Complexity of Plate Probabilistic Models.
Proceedings of the Scalable Uncertainty Management - 9th International Conference, 2015

The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Bayesian Networks Specified Using Propositional and Relational Constructs: Combined, Data, and Domain Complexity.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Probabilistic Inference in Credal Networks: New Complexity Results.
J. Artif. Intell. Res., 2014

Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Trading off Speed and Accuracy in Multilabel Classification.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Advances in Learning Bayesian Networks of Bounded Treewidth.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Algorithms for Hidden Markov Models with Imprecisely Specified Parameters.
Proceedings of the 2014 Brazilian Conference on Intelligent Systems, 2014

2013
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables.
Artif. Intell., 2013

On the Complexity of Strong and Epistemic Credal Networks.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Approximation Algorithms for Max-Sum-Product Problems.
Proceedings of the IJCAI 2013, 2013

An Ensemble of Bayesian Networks for Multilabel Classification.
Proceedings of the IJCAI 2013, 2013

2012
Solving Limited Memory Influence Diagrams.
J. Artif. Intell. Res., 2012

Evaluating credal classifiers by utility-discounted predictive accuracy.
Int. J. Approx. Reason., 2012

Updating credal networks is approximable in polynomial time.
Int. J. Approx. Reason., 2012

The Complexity of Approximately Solving Influence Diagrams.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Anytime Marginal MAP Inference.
Proceedings of the 29th International Conference on Machine Learning, 2012

2011
Solving Decision Problems with Limited Information.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011


  Loading...