Publications

(2020). Two Reformulation Approaches to Maximum-A-Posteriori Inference in Sum-Product Networks. PGM 2020.

PDF Code

(2020). Tractable inference in credal sentential decision diagrams. IJAR.

PDF Code DOI

(2020). Thirty years of credal networks: Specification, algorithms and complexity. IJAR.

PDF DOI

(2020). On the Performance of Planning Through Backpropagation. BRACIS 2020.

DOI

(2020). Learning Probabilistic Sentential Decision Diagrams by Sampling. KDMILE 2020.

PDF DOI

(2020). Finding Feasible Policies for Extreme Risk-Averse Agents in Probabilistic Planning. BRACIS 2020.

DOI

(2020). Decision-Aware Model Learning for Actor-Critic Methods: When Theory Does Not Meet Practice. ICBINB@NeurIPS 2020.

PDF

(2020). Complexity results for probabilistic answer set programming. IJAR.

PDF DOI

(2020). A Contact Network-Based Approach for Online Planning of Containment Measures for COVID-19. ENIAC 2020.

PDF Code DOI

(2019). Speeding up parameter and rule learning for acyclic probabilistic logic programs. IJAR.

PDF DOI

(2019). Robust Analysis of MAP Inference in Selective Sum-Product Networks. ISPTA 2019.

PDF

(2019). Exploring the Space of Probabilistic Sentential Decision Diagrams. 3rd Tractable Probabilistic Modeling Workshop.

PDF

(2019). End-To-End Imitation Learning of Lane Following Policies Using Sum-Product Networks. Anais do XVI Encontro Nacional de Inteligência Artificial e Computacional (ENIAC).

PDF DOI

(2019). Deep Reactive Policies for Planning in Stochastic Nonlinear Domains. AAAI 2019.

PDF DOI

(2018). The Finite Model Theory of Bayesian Networks: Descriptive Complexity. IJCAI.

PDF DOI

(2018). When a Robot Reaches Out for Human Help. IBERAMIA.

DOI

(2018). The complexity of Bayesian networks specified by propositional and relational languages. Artificial Intelligence.

PDF DOI

(2018). Robustifying sum-product networks. International Journal of Approximate Reasoning.

PDF DOI

(2018). Advances in Automatically Solving the ENEM. BRACIS 2018.

PDF Dataset Project DOI

(2017). University Entrance Exam as a Guiding Test for Artificial Intelligence. BRACIS 2017.

PDF Dataset Project DOI

(2017). The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning.

PDF DOI

(2017). The Descriptive Complexity of Bayesian Network Specifications. ECSQARU.

DOI

(2017). The Complexity of Inferences and Explanations in Probabilistic Logic Programming. ECSQARU.

DOI

(2017). Speeding-up ProbLog's Parameter Learning. Proceedings of the Seventh International Workshop on Statistical Relational AI.

PDF

(2017). Parameter Learning in ProbLog with Probabilistic Rules. KDMILE.

(2017). On Using Sum-Product Networks For Multi-Label Classification. BRACIS 2017.

PDF DOI

(2017). On the Semantics and Complexity of Probabilistic Logic Programs. JAIR.

PDF DOI

(2017). On the complexity of propositional and relational credal networks. IJAR.

PDF DOI

(2017). Modeling Markov Decision Processes with Imprecise Probabilities Using Probabilistic Logic Programming. ISIPTA 2017.

PDF

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

PDF

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

DOI

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

PDF

(2016). The Well-Founded Semantics of Cyclic Probabilistic Logic Programs. XIII Encontro Nacional de Inteligência Artificial e Computacional (ENIAC).

(2016). The structure and complexity of credal semantics. Proceedings of the 3rd International Workshop on Probabilistic Logic Programming.

(2016). The Effect of Combination Functions on the Complexity of Relational Bayesian Networks. Proceedings of the Eighth International Conference on Probabilistic Graphical Models.

Slides

(2016). Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity. PGM.

(2016). Markov Decision Processes Specified by Probabilistic Logic Programming: Representation and Solution. BRACIS 2016.

PDF DOI

(2016). Improving Acyclic Selection Order-Based Bayesian Network Structure Learning. XIII Encontro Nacional de Inteligência Artificial e Computacional (ENIAC).

(2016). Hidden Markov models with set-valued parameters. Neurocomputing.

PDF DOI

(2016). Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning.

PDF DOI

(2016). Better Initialization Heuristics for Order-based Bayesian Network Structure Learning. Journal of Information and Data Management.

(2015). The Complexity of Plate Probabilistic Models. Proceedings of the Ninth International Conference on Scalable Uncertainty Management.

PDF DOI

(2015). The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages. IJCAI.

PDF Slides

(2015). Specifying Probabilistic Relational Models with Description Logics. Anais do XII Encontro Nacional de Inteligência Artificial e Computacional.

PDF

(2015). On the Complexity of Propositional and Relational Credal Networks. Proceedings of the Ninth International Symposium on Imprecise Probability: Theories and Applications.

PDF

(2015). Initialization Heuristics for Greedy Bayesian Network Structure Learning. Proceedings of the Third Symposium on Knowledge Discovery, Mining and Learning.

(2015). Early classification of time series by hidden Markov models with set-valued parameters. Proceedings of the NIPS Time Series Workshop.

PDF

(2015). DL-Lite Bayesian Networks: A Tractable Probabilistic Graphical Model. Proceedings of the Ninth International Conference on Scalable Uncertainty Management.

PDF DOI

(2015). Bayesian Networks of Bounded Treewith: A Performance Analysis. Anais do XII Encontro Nacional de Inteligência Artificial e Computacional.

PDF

(2015). A Tractable Class of Model Counting Problems. Anais do XII Encontro Nacional de Inteligência Artificial e Computacional.

PDF

(2014). Trading off Speed and Accuracy in Multilabel Classification. PGM.

DOI

(2014). Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams. PGM.

Code DOI

(2014). Probabilistic Inference in Credal Networks: New Complexity Results. Journal of Artificial Intelligence Research.

DOI

(2014). Equivalences between Maximum a Posteriori Inference in Bayesian Networks and Maximum Expected Utility Computation in Influence Diagrams. Proceedings of the 7th European Workshop on Probabilistic Graphical Models.

DOI

(2014). Algorithms for Hidden Markov Models With Imprecisely Specified Parameters. BRACIS.

PDF Code DOI

(2014). Advances in Learning Bayesian Networks of Bounded Treewidth. Advances in Neural Information Processing Systems 27.

PDF

(2014). Advances in Learning Bayesian Networks of Bounded Treewidth.

PDF

(2013). On the Complexity of Strong and Epistemic Credal Networks. UAI.

PDF

(2013). On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Artificial Intelligence.

PDF DOI

(2013). An Ensemble of Bayesian Networks for Multilabel Classification. IJCAI 2015.

PDF

(2012). Updating Credal Networks is Approximable in Polynomial Time. International Journal of Approximate Reasoning.

PDF DOI

(2012). The Complexity of Approximately Solving Influence Diagrams. UAI.

PDF

(2012). Solving Limited Memory Influence Diagrams. Journal of Artificial Intelligence Research.

PDF

(2012). Evaluating credal classifiers by utility-discounted predictive accuracy. International Journal of Approximate Reasoning.

PDF DOI

(2012). Anytime Marginal MAP Inference. ICML.

PDF

(2011). Solving Limited Memory Influence Diagrams. ArXiv e-prints.

PDF

(2011). Utility-Based Accuracy Measures to Empirically Evaluate Credal Classifiers. ISIPTA ‘11: Proceedings of the Seventh International Symposium on Imprecise Probability: Theories and Applications.

PDF

(2011). Solving Decision Problems with Limited Information. NIPS.

PDF

(2011). A Fully Polynomial Time Approximation Scheme for Updating Credal Networks of Bounded Treewidth and Number of Variable States. ISIPTA ‘11: Proceedings of the Seventh International Symposium on Imprecise Probability: Theories and Applications.

PDF

(2009). Representing and Classifying User Reviews. Encontro Nacional de Inteligência Artificial.

PDF

(2008). Using Social Data to Predict Trust on Web Communities : A Case Study with the Epinions.com Website. Workshop on Information Visualization and Analysis in Social Networks (WIVA).

PDF

(2008). Managing Trust in Virtual Communities with Markov Logic. IV Workshop on MSc Dissertation and PhD Thesis in Artificial Intelligence (WTDIA).

PDF