Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

On the Coherence of Probabilistic Relational Formalisms

Full text
Author(s):
De Bona, Glauber [1] ; Cozman, Fabio G. [1]
Total Authors: 2
Affiliation:
[1] Univ Sao Paulo, Escola Politecn, BR-05508010 Sao Paulo - Brazil
Total Affiliations: 1
Document type: Journal article
Source: Entropy; v. 20, n. 4 APR 2018.
Web of Science Citations: 1
Abstract

There are several formalisms that enhance Bayesian networks by including relations amongst individuals as modeling primitives. For instance, Probabilistic Relational Models (PRMs) use diagrams and relational databases to represent repetitive Bayesian networks, while Relational Bayesian Networks (RBNs) employ first-order probability formulas with the same purpose. We examine the coherence checking problem for those formalisms; that is, the problem of guaranteeing that any grounding of a well-formed set of sentences does produce a valid Bayesian network. This is a novel version of de Finetti's problem of coherence checking for probabilistic assessments. We show how to reduce the coherence checking problem in relational Bayesian networks to a validity problem in first-order logic augmented with a transitive closure operator and how to combine this logic-based approach with faster, but incomplete algorithms. (AU)

FAPESP's process: 16/18841-0 - Inference and learning algorithms for probabilistic logic programming
Grantee:Fabio Gagliardi Cozman
Support Opportunities: Research Grants - Research Partnership for Technological Innovation - PITE
FAPESP's process: 16/25928-4 - Probabilistic extensions for fragments of first-order logic
Grantee:Glauber de Bona
Support Opportunities: Scholarships in Brazil - Post-Doctoral