Probabilistic logic with independence

Fabio Gagliardi Cozman; Cassio Polpo de Campos; José Carlos Ferreira da Rocha

doi:10.1016/j.ijar.2007.08.002

Probabilistic logic with independence

Fabio Gagliardi Cozman, Cassio Polpo de Campos, José Carlos Ferreira da Rocha

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. © 2007 Elsevier Inc. All rights reserved.

Original language	American English
Pages (from-to)	3-17
Number of pages	15
Journal	International Journal of Approximate Reasoning
DOIs	https://doi.org/10.1016/j.ijar.2007.08.002
State	Published - 1 Sep 2008
Externally published	Yes

Access to Document

10.1016/j.ijar.2007.08.002

Cite this

@article{29704447ac3c4efeb924a5876f293fb2,

title = "Probabilistic logic with independence",

abstract = "This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. {\textcopyright} 2007 Elsevier Inc. All rights reserved.",

author = "Cozman, {Fabio Gagliardi} and {de Campos}, {Cassio Polpo} and {Ferreira da Rocha}, {Jos{\'e} Carlos}",

year = "2008",

month = sep,

day = "1",

doi = "10.1016/j.ijar.2007.08.002",

language = "American English",

pages = "3--17",

journal = "International Journal of Approximate Reasoning",

issn = "0888-613X",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - Probabilistic logic with independence

AU - Cozman, Fabio Gagliardi

AU - de Campos, Cassio Polpo

AU - Ferreira da Rocha, José Carlos

PY - 2008/9/1

Y1 - 2008/9/1

N2 - This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. © 2007 Elsevier Inc. All rights reserved.

AB - This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. © 2007 Elsevier Inc. All rights reserved.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=48849087790&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=48849087790&origin=inward

U2 - 10.1016/j.ijar.2007.08.002

DO - 10.1016/j.ijar.2007.08.002

M3 - Article

SP - 3

EP - 17

JO - International Journal of Approximate Reasoning

JF - International Journal of Approximate Reasoning

SN - 0888-613X

ER -

Probabilistic logic with independence

Abstract

Access to Document

Other files and links

Fingerprint

Cite this