| Publication | Date of Publication | Type |
|---|
Closed-form solutions in learning probabilistic logic programs by exact score maximization
Lecture Notes in Computer Science | 2022-11-04 | Paper |
| Cautious classification with data missing not at random using generative random forests | 2022-06-15 | Paper |
Efficient algorithms for risk-sensitive Markov decision processes with limited budget
International Journal of Approximate Reasoning | 2021-12-13 | Paper |
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
International Journal of Approximate Reasoning | 2020-10-22 | Paper |
Thirty years of credal networks: specification, algorithms and complexity
International Journal of Approximate Reasoning | 2020-10-22 | Paper |
Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks
International Journal of Approximate Reasoning | 2020-10-22 | Paper |
Tractable inference in credal sentential decision diagrams
International Journal of Approximate Reasoning | 2020-10-22 | Paper |
Complexity results for probabilistic answer set programming
International Journal of Approximate Reasoning | 2020-02-26 | Paper |
The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
International Journal of Approximate Reasoning | 2019-12-30 | Paper |
Speeding up parameter and rule learning for acyclic probabilistic logic programs
International Journal of Approximate Reasoning | 2019-06-27 | Paper |
Robustifying sum-product networks
International Journal of Approximate Reasoning | 2019-02-20 | Paper |
The complexity of Bayesian networks specified by propositional and relational languages
Artificial Intelligence | 2019-01-18 | Paper |
On the semantics and complexity of probabilistic logic programs
Journal of Artificial Intelligence Research | 2017-10-24 | Paper |
The effect of combination functions on the complexity of relational Bayesian networks
International Journal of Approximate Reasoning | 2017-10-11 | Paper |
| The complexity of inferences and explanations in probabilistic logic programming | 2017-09-05 | Paper |
| The descriptive complexity of Bayesian network specifications | 2017-09-05 | Paper |
On the complexity of propositional and relational credal networks
International Journal of Approximate Reasoning | 2017-03-29 | Paper |
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
International Journal of Approximate Reasoning | 2015-12-03 | Paper |
Fast local search methods for solving limited memory influence diagrams
International Journal of Approximate Reasoning | 2015-12-03 | Paper |
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
Artificial Intelligence | 2015-08-27 | Paper |
Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
Probabilistic Graphical Models | 2015-01-14 | Paper |
Trading off speed and accuracy in multilabel classification
Probabilistic Graphical Models | 2015-01-14 | Paper |
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
Probabilistic Graphical Models | 2015-01-14 | Paper |
Probabilistic inference in credal networks: new complexity results
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
Evaluating credal classifiers by utility-discounted predictive accuracy
International Journal of Approximate Reasoning | 2013-06-13 | Paper |
Updating credal networks is approximable in polynomial time
International Journal of Approximate Reasoning | 2013-06-13 | Paper |
Solving limited memory influence diagrams
The Journal of Artificial Intelligence Research (JAIR) | 2012-08-27 | Paper |
