List of works - Fabio Gagliardi Cozman

Approximate algorithms for credal networks with binary variables

scholarly article by Jaime Shinsuke Ide & Fabio Gagliardi Cozman published April 2008 in International Journal of Approximate Reasoning

Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization

scientific article published in 2017

Combining Probability and Logic

scientific article published in June 2009

DL-Lite Bayesian Networks: A Tractable Probabilistic Graphical Model

scientific article published in 2015

Evaluation of linear relaxations in Ad Network optimization for online marketing

article by Valdinei Freire et al published 23 July 2015 in Journal of the Brazilian Computer Society

Fast local search methods for solving limited memory influence diagrams

scientific article published in January 2016

Generalized probabilistic satisfiability through integer programming

Markov Decision Processes Specified by Probabilistic Logic Programming: Representation and Solution

scientific article published in October 2016

On the complexity of propositional and relational credal networks

scientific article published in April 2017

Reasoning with imprecise probabilities

Robustifying sum-product networks ⬇️

schorlaly article

Semisupervised learning of classifiers: theory, algorithms, and their application to human-computer interaction.

scientific article published in December 2004

Speeding up parameter and rule learning for acyclic probabilistic logic programs

scientific article published in March 2019

The Complexity of Inferences and Explanations in Probabilistic Logic Programming

scientific article published in 2017

The Complexity of Plate Probabilistic Models

scientific article published in 2015

The Descriptive Complexity of Bayesian Network Specifications

scientific article published in 2017

The complexity of Bayesian networks specified by propositional and relational languages ⬇️

scientific article published in September 2018

The effect of combination functions on the complexity of relational Bayesian networks

scientific article published in June 2017

Using mathematical programming to solve Factored Markov Decision Processes with Imprecise Probabilities

scientific article published in October 2011

List of works by Fabio Gagliardi Cozman

Approximate algorithms for credal networks with binary variables

Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization

Combining Probability and Logic

DL-Lite Bayesian Networks: A Tractable Probabilistic Graphical Model

Evaluation of linear relaxations in Ad Network optimization for online marketing

Fast local search methods for solving limited memory influence diagrams

Generalized probabilistic satisfiability through integer programming

Markov Decision Processes Specified by Probabilistic Logic Programming: Representation and Solution

On the complexity of propositional and relational credal networks

Reasoning with imprecise probabilities

Robustifying sum-product networks ⬇️

Semisupervised learning of classifiers: theory, algorithms, and their application to human-computer interaction.

Speeding up parameter and rule learning for acyclic probabilistic logic programs

The Complexity of Inferences and Explanations in Probabilistic Logic Programming

The Complexity of Plate Probabilistic Models

The Descriptive Complexity of Bayesian Network Specifications

The complexity of Bayesian networks specified by propositional and relational languages ⬇️

The effect of combination functions on the complexity of relational Bayesian networks

Using mathematical programming to solve Factored Markov Decision Processes with Imprecise Probabilities