Home
Projects
Publications
Teaching
Contact
Light
Dark
Automatic
Fabio Gagliardi Cozman
Latest
Specifying credal sets with probabilistic answer set programming
Assessing Good, Bad and Ugly Arguments Generated by ChatGPT: a New Dataset, its Methodology and Associated Tasks
Integrating Question Answering and Text-to-SQL in Portuguese
Complexity results for probabilistic answer set programming
The Joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference
Thirty years of credal networks: Specification, algorithms and complexity
Speeding up parameter and rule learning for acyclic probabilistic logic programs
The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
The Finite Model Theory of Bayesian Networks: Descriptive Complexity
Robustifying sum-product networks
The complexity of Bayesian networks specified by propositional and relational languages
Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization
Credal Sum-Product Networks
Modeling Markov Decision Processes with Imprecise Probabilities Using Probabilistic Logic Programming
On the complexity of propositional and relational credal networks
On the Semantics and Complexity of Probabilistic Logic Programs
Parameter Learning in ProbLog with Probabilistic Rules
Speeding-up ProbLog's Parameter Learning
The Complexity of Inferences and Explanations in Probabilistic Logic Programming
The Descriptive Complexity of Bayesian Network Specifications
The effect of combination functions on the complexity of relational Bayesian networks
The Complexity of Bayesian Networks Specified by Propositional and Relational Languages
Fast local search methods for solving limited memory influence diagrams
Markov Decision Processes Specified by Probabilistic Logic Programming: Representation and Solution
Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity
The Effect of Combination Functions on the Complexity of Relational Bayesian Networks
The structure and complexity of credal semantics
The Well-Founded Semantics of Cyclic Probabilistic Logic Programs
A Tractable Class of Model Counting Problems
Bayesian Networks of Bounded Treewith: A Performance Analysis
Bayesian Networks Specified Using Propositional and Relational Constructs: Combined, Data, and Domain Complexity
DL-Lite Bayesian Networks: A Tractable Probabilistic Graphical Model
On the Complexity of Propositional and Relational Credal Networks
Specifying Probabilistic Relational Models with Description Logics
The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages
The Complexity of Plate Probabilistic Models
Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams
Representing and Classifying User Reviews
Managing Trust in Virtual Communities with Markov Logic
Using Social Data to Predict Trust on Web Communities : A Case Study with the Epinions.com Website
Cite
×