default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Deratani Mauá
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c45]Igor Cataneo Silveira, André Barbosa, Denis Deratani Mauá:
A New Benchmark for Automatic Essay Scoring in Portuguese. PROPOR 2024: 228-237- [i13]Victor Hugo Nascimento Rocha, Igor Cataneo Silveira, Paulo Pirozelli, Denis Deratani Mauá, Fábio Gagliardi Cozman:
Assessing Good, Bad and Ugly Arguments Generated by ChatGPT: a New Dataset, its Methodology and Associated Tasks. CoRR abs/2406.15130 (2024) - 2023
- [c44]Victor Hugo Nascimento Rocha
, Igor Cataneo Silveira, Paulo Pirozelli, Denis Deratani Mauá, Fábio Gagliardi Cozman:
Assessing Good, Bad and Ugly Arguments Generated by ChatGPT: a New Dataset, its Methodology and Associated Tasks. EPIA (1) 2023: 428-440 - [c43]Denis Deratani Mauá, Fábio Gagliardi Cozman:
Specifying credal sets with probabilistic answer set programming. ISIPTA 2023: 321-332 - [i12]Renato Lui Geh, Jonas Gonçalves, Igor Cataneo Silveira, Denis Deratani Mauá, Fábio Gagliardi Cozman:
dPASP: A Comprehensive Differentiable Probabilistic Answer Set Programming Environment For Neurosymbolic Learning and Reasoning. CoRR abs/2308.02944 (2023) - 2022
- [c42]Ângelo Gregório Lovatto, Leliane Nunes de Barros, Denis Deratani Mauá:
Exploration Versus Exploitation in Model-Based Reinforcement Learning: An Empirical Study. BRACIS (2) 2022: 30-44 - [c41]Luis Moneda, Denis Deratani Mauá:
Time Robust Trees: Using Temporal Invariance to Improve Generalization. BRACIS (1) 2022: 385-397 - [c40]Marcos Menon José, Marcelo Archanjo José, Denis Deratani Mauá, Fábio Gagliardi Cozman:
Integrating Question Answering and Text-to-SQL in Portuguese. PROPOR 2022: 278-287 - [i11]Marcos Menon José, Marcelo Archanjo José, Denis Deratani Mauá, Fábio Gagliardi Cozman:
Integrating question answering and text-to-SQL in Portuguese. CoRR abs/2202.04048 (2022) - [i10]Paulo Pirozelli, Ais B. R. Castro, Ana Luiza C. de Oliveira, André Seidel Oliveira, Flávio Nakasato Cação, Igor Cataneo Silveira, João G. M. Campos, Laura C. Motheo, Leticia F. Figueiredo, Lucas Francisco Amaral Orosco Pellicer, Marcelo A. José, Marcos Menon José, Pedro de M. Ligabue, Ricardo S. Grava, Rodrigo M. Tavares, Vinícius B. Matos, Yan V. Sym, Anna H. R. Costa, Anarosa A. F. Brandão, Denis Deratani Mauá, Fábio Gagliardi Cozman, Sarajane M. Peres:
The BLue Amazon Brain (BLAB): A Modular Architecture of Services about the Brazilian Maritime Territory. CoRR abs/2209.07928 (2022) - 2021
- [j23]Denis Deratani Mauá, Cassio Polpo de Campos:
Special Issue on Robustness in Probabilistic Graphical Models. Int. J. Approx. Reason. 137: 113 (2021) - [j22]Daniel Augusto de Melo Moreira, Karina Valdivia Delgado, Leliane Nunes de Barros, Denis Deratani Mauá:
Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. Int. J. Approx. Reason. 139: 143-165 (2021) - [c39]Julissa Villanueva Llerena, Denis Deratani Mauá, Alessandro Antonucci:
Cautious Classification with Data Missing Not at Random Using Generative Random Forests. ECSQARU 2021: 284-298 - [c38]Renato Lui Geh, Denis Deratani Mauá:
Learning probabilistic sentential decision diagrams under logic constraints by sampling and averaging. UAI 2021: 2039-2049 - 2020
- [j21]Denis Deratani Mauá, Fábio Gagliardi Cozman:
Complexity results for probabilistic answer set programming. Int. J. Approx. Reason. 118: 133-154 (2020) - [j20]Lilith Mattei, Alessandro Antonucci, Denis Deratani Mauá, Alessandro Facchini, Julissa Villanueva Llerena:
Tractable inference in credal sentential decision diagrams. Int. J. Approx. Reason. 125: 26-48 (2020) - [j19]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference. Int. J. Approx. Reason. 125: 218-239 (2020) - [j18]Denis Deratani Mauá, Fábio Gagliardi Cozman:
Thirty years of credal networks: Specification, algorithms and complexity. Int. J. Approx. Reason. 126: 133-157 (2020) - [j17]Julissa Villanueva Llerena, Denis Deratani Mauá:
Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. Int. J. Approx. Reason. 126: 158-180 (2020) - [c37]Julissa Villanueva Llerena, Denis Deratani Mauá:
Efficient Predictive Uncertainty Estimators for Deep Probabilistic Models. AAAI 2020: 13740-13741 - [c36]Milton Condori Fernandez, Leliane N. de Barros, Denis Deratani Mauá, Karina Valdivia Delgado, Valdinei Freire:
Finding Feasible Policies for Extreme Risk-Averse Agents in Probabilistic Planning. BRACIS (2) 2020: 93-107 - [c35]Renato Scaroni, Thiago Pereira Bueno, Leliane N. de Barros, Denis Deratani Mauá:
On the Performance of Planning Through Backpropagation. BRACIS (2) 2020: 108-122 - [c34]Ângelo Gregório Lovatto, Thiago Pereira Bueno, Denis Deratani Mauá, Leliane N. de Barros:
Decision-Aware Model Learning for Actor-Critic Methods: When Theory Does Not Meet Practice. ICBINB@NeurIPS 2020: 76-86 - [c33]Denis Deratani Mauá, Heitor Ribeiro Reis, Gustavo Perez Katague, Alessandro Antonucci:
Two Reformulation Approaches to Maximum-A-Posteriori Inference in Sum-Product Networks. PGM 2020: 293-304 - [i9]Lilith Mattei, Alessandro Antonucci, Denis Deratani Mauá, Alessandro Facchini, Julissa Villanueva Llerena:
Tractable Inference in Credal Sentential Decision Diagrams. CoRR abs/2008.08524 (2020)
2010 – 2019
- 2019
- [j16]Francisco H. O. V. de Faria, Arthur Colombini Gusmão, Glauber De Bona, Denis Deratani Mauá, Fábio Gagliardi Cozman:
Speeding up parameter and rule learning for acyclic probabilistic logic programs. Int. J. Approx. Reason. 106: 32-50 (2019) - [j15]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. Int. J. Approx. Reason. 110: 107-126 (2019) - [c32]Thiago Pereira Bueno, Leliane N. de Barros, Denis Deratani Mauá, Scott Sanner:
Deep Reactive Policies for Planning in Stochastic Nonlinear Domains. AAAI 2019: 7530-7537 - [c31]Julissa Giuliana Villanueva Llerena, Denis Deratani Mauá:
Robust Analysis of MAP Inference in Selective Sum-Product Networks. ISIPTA 2019: 430-440 - 2018
- [j14]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The complexity of Bayesian networks specified by propositional and relational languages. Artif. Intell. 262: 96-141 (2018) - [j13]Denis Deratani Mauá, Diarmaid Conaty, Fábio Gagliardi Cozman, Katja Poppenhaeger, Cassio Polpo de Campos:
Robustifying sum-product networks. Int. J. Approx. Reason. 101: 163-180 (2018) - [c30]Igor Cataneo Silveira, Denis Deratani Mauá:
Advances in Automatically Solving the ENEM. BRACIS 2018: 43-48 - [c29]Ignasi Andrés, Leliane Nunes de Barros, Denis Deratani Mauá, Thiago D. Simão:
When a Robot Reaches Out for Human Help. IBERAMIA 2018: 277-289 - [c28]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The Finite Model Theory of Bayesian Networks: Descriptive Complexity. IJCAI 2018: 5229-5233 - 2017
- [j12]Fábio Gagliardi Cozman, Denis Deratani Mauá:
On the complexity of propositional and relational credal networks. Int. J. Approx. Reason. 83: 298-319 (2017) - [j11]Denis Deratani Mauá, Fábio Gagliardi Cozman:
The effect of combination functions on the complexity of relational Bayesian networks. Int. J. Approx. Reason. 85: 178-195 (2017) - [j10]Fábio Gagliardi Cozman, Denis Deratani Mauá:
On the Semantics and Complexity of Probabilistic Logic Programs. J. Artif. Intell. Res. 60: 221-262 (2017) - [c27]Julissa Villanueva Llerena, Denis Deratani Mauá:
On Using Sum-Product Networks for Multi-label Classification. BRACIS 2017: 25-30 - [c26]Igor Cataneo Silveira, Denis Deratani Mauá:
University Entrance Exam as a Guiding Test for Artificial Intelligence. BRACIS 2017: 426-431 - [c25]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The Descriptive Complexity of Bayesian Network Specifications. ECSQARU 2017: 93-103 - [c24]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The Complexity of Inferences and Explanations in Probabilistic Logic Programming. ECSQARU 2017: 449-458 - [c23]Thiago Pereira Bueno, Denis Deratani Mauá, Leliane N. de Barros, Fábio Gagliardi Cozman:
Modeling Markov Decision Processes with Imprecise Probabilities Using Probabilistic Logic Programming. ISIPTA 2017: 49-60 - [c22]Denis Deratani Mauá, Fábio Gagliardi Cozman, Diarmaid Conaty, Cassio P. de Campos:
Credal Sum-Product Networks. ISIPTA 2017: 205-216 - [c21]Francisco Henrique Otte Vieira de Faria, Fábio Gagliardi Cozman, Denis Deratani Mauá:
Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization. SUM 2017: 119-133 - [c20]Diarmaid Conaty, Cassio P. de Campos, Denis Deratani Mauá:
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks. UAI 2017 - [i8]Fábio Gagliardi Cozman, Denis Deratani Mauá:
On the Semantics and Complexity of Probabilistic Logic Programs. CoRR abs/1701.09000 (2017) - [i7]Denis Deratani Mauá, Cassio P. de Campos:
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks. CoRR abs/1703.06045 (2017) - [i6]Francisco H. O. V. de Faria, Arthur C. Gusmão, Fábio Gagliardi Cozman, Denis Deratani Mauá:
Speeding-up ProbLog's Parameter Learning. CoRR abs/1707.08151 (2017) - 2016
- [j9]Denis Deratani Mauá:
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams. Int. J. Approx. Reason. 68: 211-229 (2016) - [j8]Denis Deratani Mauá, Fábio Gagliardi Cozman:
Fast local search methods for solving limited memory influence diagrams. Int. J. Approx. Reason. 68: 230-245 (2016) - [j7]Denis Deratani Mauá, Alessandro Antonucci, Cassio Polpo de Campos:
Hidden Markov models with set-valued parameters. Neurocomputing 180: 94-107 (2016) - [j6]Walter Perez Urcia, Denis Deratani Mauá:
Better Initialization Heuristics for Order-based Bayesian Network Structure Learning. J. Inf. Data Manag. 7(2): 181-195 (2016) - [c19]Thiago Pereira Bueno, Denis Deratani Mauá, Leliane N. de Barros, Fábio Gagliardi Cozman:
Markov Decision Processes Specified by Probabilistic Logic Programming: Representation and Solution. BRACIS 2016: 337-342 - [c18]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The Structure and Complexity of Credal Semantics. PLP@ILP 2016: 3-14 - [c17]Fábio Gagliardi Cozman, Denis Deratani Mauá:
Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity. Probabilistic Graphical Models 2016: 110-122 - [c16]Denis Deratani Mauá, Fábio Gagliardi Cozman:
The Effect of Combination Functions on the Complexity of Relational Bayesian Networks. Probabilistic Graphical Models 2016: 333-344 - [i5]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The Complexity of Bayesian Networks Specified by Propositional and Relational Languages. CoRR abs/1612.01120 (2016) - 2015
- [c15]Fábio Gagliardi Cozman, Denis Deratani Mauá:
Bayesian Networks Specified Using Propositional and Relational Constructs: Combined, Data, and Domain Complexity. AAAI 2015: 3519-3525 - [c14]Denis Deratani Mauá, Cassio P. de Campos, Fábio Gagliardi Cozman:
The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages. IJCAI 2015: 889-895 - [c13]Fábio Gagliardi Cozman, Denis Deratani Mauá:
The Complexity of Plate Probabilistic Models. SUM 2015: 36-49 - [c12]Denis Deratani Mauá, Fábio Gagliardi Cozman:
DL-Lite Bayesian Networks: A Tractable Probabilistic Graphical Model. SUM 2015: 50-64 - 2014
- [j5]Denis Deratani Mauá, Cassio P. de Campos, Alessio Benavoli, Alessandro Antonucci:
Probabilistic Inference in Credal Networks: New Complexity Results. J. Artif. Intell. Res. 50: 603-637 (2014) - [c11]Denis Deratani Mauá, Cassio Polpo de Campos, Alessandro Antonucci:
Algorithms for Hidden Markov Models with Imprecisely Specified Parameters. BRACIS 2014: 186-191 - [c10]Siqi Nie, Denis Deratani Mauá, Cassio P. de Campos, Qiang Ji:
Advances in Learning Bayesian Networks of Bounded Treewidth. NIPS 2014: 2285-2293 - [c9]Giorgio Corani, Alessandro Antonucci, Denis Deratani Mauá, Sandra Gabaglio:
Trading off Speed and Accuracy in Multilabel Classification. Probabilistic Graphical Models 2014: 145-159 - [c8]Denis Deratani Mauá:
Equivalences between Maximum a Posteriori Inference in Bayesian Networks and Maximum Expected Utility Computation in Influence Diagrams. Probabilistic Graphical Models 2014: 318-333 - [c7]Denis Deratani Mauá, Fábio Gagliardi Cozman:
Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams. Probabilistic Graphical Models 2014: 334-349 - [i4]Siqi Nie, Denis Deratani Mauá, Cassio Polpo de Campos, Qiang Ji:
Advances in Learning Bayesian Networks of Bounded Treewidth. CoRR abs/1406.1411 (2014) - 2013
- [j4]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Artif. Intell. 205: 30-38 (2013) - [c6]Alessandro Antonucci, Giorgio Corani, Denis Deratani Mauá, Sandra Gabaglio:
An Ensemble of Bayesian Networks for Multilabel Classification. IJCAI 2013: 1220-1225 - [c5]Denis Deratani Mauá:
Approximation Algorithms for Max-Sum-Product Problems. IJCAI 2013: 3235-3236 - [c4]Denis Deratani Mauá, Cassio Polpo de Campos, Alessio Benavoli, Alessandro Antonucci:
On the Complexity of Strong and Epistemic Credal Networks. UAI 2013 - [i3]Denis Deratani Mauá, Cassio Polpo de Campos, Alessio Benavoli, Alessandro Antonucci:
On the Complexity of Strong and Epistemic Credal Networks. CoRR abs/1309.6845 (2013) - 2012
- [j3]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Updating credal networks is approximable in polynomial time. Int. J. Approx. Reason. 53(8): 1183-1199 (2012) - [j2]Marco Zaffalon, Giorgio Corani, Denis Deratani Mauá:
Evaluating credal classifiers by utility-discounted predictive accuracy. Int. J. Approx. Reason. 53(8): 1282-1301 (2012) - [j1]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. J. Artif. Intell. Res. 44: 97-140 (2012) - [c3]Denis Deratani Mauá, Cassio Polpo de Campos:
Anytime Marginal MAP Inference. ICML 2012 - [c2]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. UAI 2012: 604-613 - [i2]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. CoRR abs/1210.4890 (2012) - 2011
- [c1]Denis Deratani Mauá, Cassio Polpo de Campos:
Solving Decision Problems with Limited Information. NIPS 2011: 603-611 - [i1]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. CoRR abs/1109.1754 (2011)
Coauthor Index
Leliane Nunes de Barros
aka: Leliane N. de Barros
aka: Leliane N. de Barros
Cassio P. de Campos
aka: Cassio Polpo de Campos
aka: Cassio Polpo de Campos
Julissa Villanueva Llerena
aka: Julissa Giuliana Villanueva Llerena
aka: Julissa Giuliana Villanueva Llerena
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
