TY - GEN
T1 - Probabilistic logic with strong independence
AU - Cozman, Fabio G.
AU - de Campos, Cassio P.
AU - da Rocha, José Carlos F.
PY - 2006
Y1 - 2006
N2 - This papers investigates the manipulation of statements of strong independence in probabilistic logic. Inference methods based on polynomial programming are presented for strong independence, both for unconditional and conditional cases. We also consider graph-theoretic representations, where each node in a graph is associated with a Boolean variable and edges carry a Markov condition. The resulting model generalizes Bayesian networks, allowing probabilistic assessments and logical constraints to be mixed.
AB - This papers investigates the manipulation of statements of strong independence in probabilistic logic. Inference methods based on polynomial programming are presented for strong independence, both for unconditional and conditional cases. We also consider graph-theoretic representations, where each node in a graph is associated with a Boolean variable and edges carry a Markov condition. The resulting model generalizes Bayesian networks, allowing probabilistic assessments and logical constraints to be mixed.
UR - http://www.scopus.com/inward/record.url?scp=33751371479&partnerID=8YFLogxK
U2 - 10.1007/11874850_65
DO - 10.1007/11874850_65
M3 - Conference contribution
SN - 3540454624
SN - 978-3-540-45462-5
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 612
EP - 621
BT - Advances in Artificial Intelligence - IBERAMIA-SBIA 2006 - 2nd International Joint Conference, 10th Ibero-American Conference on AI, 18th Brazilian AI Symposium, Proceedings
A2 - Sichman, Jaime Simão
A2 - Coelho, Helder
A2 - Oliveira Rezende, Solange
PB - Springer
T2 - IBERAMIA-SBIA 2006 - 2nd International Joint Conference, 10th Ibero-American Conference on AI, 18th Brazilian AI Symposium
Y2 - 23 October 2006 through 27 October 2006
ER -