×

Mauá, Denis Deratani

Compute Distance To:
Author ID: maua.denis-deratani Recent zbMATH articles by "Mauá, Denis Deratani"
Published as: Mauá, Denis Deratani; Mauá, Denis D.; Deratani Mauá, Denis; Maua, D. D.; Mauá, Denis

Publications by Year

Citations contained in zbMATH Open

21 Publications have been cited 77 times in 47 Documents Cited by Year
Evaluating credal classifiers by utility-discounted predictive accuracy. Zbl 1266.62042
Zaffalon, Marco; Corani, Giorgio; Mauá, Denis
14
2012
Probabilistic inference in credal networks: new complexity results. Zbl 1366.68329
Mauá, Denis Deratani; de Campos, Cassio Polpo; Benavoli, Alessio; Antonucci, Alessandro
10
2014
On the semantics and complexity of probabilistic logic programs. Zbl 1418.68027
Gagliardi Cozman, Fabio; Deratani Mauá, Denis
8
2017
Solving limited memory influence diagrams. Zbl 1280.68100
Maua, D. D.; De Campos, C. P.; Zaffalon, M.
7
2012
Trading off speed and accuracy in multilabel classification. Zbl 1443.68142
Corani, Giorgio; Antonucci, Alessandro; Mauá, Denis D.; Gabaglio, Sandra
6
2014
Updating credal networks is approximable in polynomial time. Zbl 1266.68178
Mauá, Denis D.; de Campos, Cassio P.; Zaffalon, Marco
6
2012
The complexity of Bayesian networks specified by propositional and relational languages. Zbl 1451.68257
Cozman, Fabio G.; Mauá, Denis D.
4
2018
Robustifying sum-product networks. Zbl 1453.62533
Deratani Mauá, Denis; Conaty, Diarmaid; Gagliardi Cozman, Fabio; Poppenhaeger, Katja; Polpo de Campos, Cassio
3
2018
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Zbl 1334.68202
Mauá, Denis Deratani; de Campos, Cassio Polpo; Zaffalon, Marco
3
2013
Complexity results for probabilistic answer set programming. Zbl 1468.68215
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
2
2020
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. Zbl 1490.68072
Cozman, Fabio Gagliardi; Mauá, Denis Deratani
2
2020
Thirty years of credal networks: specification, algorithms and complexity. Zbl 1490.68229
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
2
2020
The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws. Zbl 1460.68042
Cozman, Fabio Gagliardi; Mauá, Denis Deratani
2
2019
On the complexity of propositional and relational credal networks. Zbl 1404.68161
Gagliardi Cozman, Fabio; Deratani Mauá, Denis
1
2017
Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. Zbl 1490.68193
Villanueva Llerena, Julissa; Mauá, Denis Deratani
1
2020
The descriptive complexity of Bayesian network specifications. Zbl 1491.68081
Cozman, Fabio G.; Mauá, Denis D.
1
2017
The complexity of inferences and explanations in probabilistic logic programming. Zbl 1491.68041
Cozman, Fabio G.; Mauá, Denis D.
1
2017
The effect of combination functions on the complexity of relational Bayesian networks. Zbl 1419.68172
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
1
2017
Speeding up \(k\)-neighborhood local search in limited memory influence diagrams. Zbl 1443.68167
Mauá, Denis D.; Cozman, Fabio G.
1
2014
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams. Zbl 1346.68203
Mauá, Denis Deratani
1
2016
Fast local search methods for solving limited memory influence diagrams. Zbl 1346.68178
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
1
2016
Complexity results for probabilistic answer set programming. Zbl 1468.68215
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
2
2020
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. Zbl 1490.68072
Cozman, Fabio Gagliardi; Mauá, Denis Deratani
2
2020
Thirty years of credal networks: specification, algorithms and complexity. Zbl 1490.68229
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
2
2020
Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. Zbl 1490.68193
Villanueva Llerena, Julissa; Mauá, Denis Deratani
1
2020
The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws. Zbl 1460.68042
Cozman, Fabio Gagliardi; Mauá, Denis Deratani
2
2019
The complexity of Bayesian networks specified by propositional and relational languages. Zbl 1451.68257
Cozman, Fabio G.; Mauá, Denis D.
4
2018
Robustifying sum-product networks. Zbl 1453.62533
Deratani Mauá, Denis; Conaty, Diarmaid; Gagliardi Cozman, Fabio; Poppenhaeger, Katja; Polpo de Campos, Cassio
3
2018
On the semantics and complexity of probabilistic logic programs. Zbl 1418.68027
Gagliardi Cozman, Fabio; Deratani Mauá, Denis
8
2017
On the complexity of propositional and relational credal networks. Zbl 1404.68161
Gagliardi Cozman, Fabio; Deratani Mauá, Denis
1
2017
The descriptive complexity of Bayesian network specifications. Zbl 1491.68081
Cozman, Fabio G.; Mauá, Denis D.
1
2017
The complexity of inferences and explanations in probabilistic logic programming. Zbl 1491.68041
Cozman, Fabio G.; Mauá, Denis D.
1
2017
The effect of combination functions on the complexity of relational Bayesian networks. Zbl 1419.68172
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
1
2017
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams. Zbl 1346.68203
Mauá, Denis Deratani
1
2016
Fast local search methods for solving limited memory influence diagrams. Zbl 1346.68178
Mauá, Denis Deratani; Cozman, Fabio Gagliardi
1
2016
Probabilistic inference in credal networks: new complexity results. Zbl 1366.68329
Mauá, Denis Deratani; de Campos, Cassio Polpo; Benavoli, Alessio; Antonucci, Alessandro
10
2014
Trading off speed and accuracy in multilabel classification. Zbl 1443.68142
Corani, Giorgio; Antonucci, Alessandro; Mauá, Denis D.; Gabaglio, Sandra
6
2014
Speeding up \(k\)-neighborhood local search in limited memory influence diagrams. Zbl 1443.68167
Mauá, Denis D.; Cozman, Fabio G.
1
2014
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Zbl 1334.68202
Mauá, Denis Deratani; de Campos, Cassio Polpo; Zaffalon, Marco
3
2013
Evaluating credal classifiers by utility-discounted predictive accuracy. Zbl 1266.62042
Zaffalon, Marco; Corani, Giorgio; Mauá, Denis
14
2012
Solving limited memory influence diagrams. Zbl 1280.68100
Maua, D. D.; De Campos, C. P.; Zaffalon, M.
7
2012
Updating credal networks is approximable in polynomial time. Zbl 1266.68178
Mauá, Denis D.; de Campos, Cassio P.; Zaffalon, Marco
6
2012

Citations by Year