Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence

Cassio Polpo de Campos; Fabio Gagliardi Cozman; José Eduardo Ochoa Luna

doi:10.1016/j.jal.2007.11.002

Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence

Cassio Polpo de Campos
, Fabio Gagliardi Cozman
, José Eduardo Ochoa Luna

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

6 Citations (Scopus)

Abstract

We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments.

Original language	English
Pages (from-to)	137-154
Number of pages	18
Journal	Journal of Applied Logic
Volume	7
Issue number	2
DOIs	https://doi.org/10.1016/j.jal.2007.11.002
Publication status	Published - 1 Jun 2009
Externally published	Yes

Funding

The work has received partial support from CNPq (grant 3000183/98-4) and FAPESP (grant 04/09568-0). The third author is supported by CAPES.

Keywords

Graph-theoretic models
Linear and multilinear programming
Probabilistic logic
Stochastic independence

Access to Document

10.1016/j.jal.2007.11.002

Cite this

@article{c68831b6a8d84373b7bdcf0f82d65975,

title = "Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence",

abstract = "We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments.",

keywords = "Graph-theoretic models, Linear and multilinear programming, Probabilistic logic, Stochastic independence",

author = "\{de Campos\}, \{Cassio Polpo\} and Cozman, \{Fabio Gagliardi\} and Luna, \{Jos{\'e} Eduardo Ochoa\}",

year = "2009",

month = jun,

day = "1",

doi = "10.1016/j.jal.2007.11.002",

language = "English",

volume = "7",

pages = "137--154",

journal = "Journal of Applied Logic",

issn = "1570-8683",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence

AU - de Campos, Cassio Polpo

AU - Cozman, Fabio Gagliardi

AU - Luna, José Eduardo Ochoa

PY - 2009/6/1

Y1 - 2009/6/1

N2 - We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments.

AB - We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments.

KW - Graph-theoretic models

KW - Linear and multilinear programming

KW - Probabilistic logic

KW - Stochastic independence

UR - https://www.scopus.com/pages/publications/64149104474

U2 - 10.1016/j.jal.2007.11.002

DO - 10.1016/j.jal.2007.11.002

M3 - Article

SN - 1570-8683

VL - 7

SP - 137

EP - 154

JO - Journal of Applied Logic

JF - Journal of Applied Logic

IS - 2

ER -

Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this