Inference and learning in probabilistic logic programs using weighted boolean formulas

D Fierens, G Van den Broeck, J Renkens… - Theory and Practice of …, 2015 - cambridge.org
Probabilistic logic programs are logic programs in which some of the facts are annotated
with probabilities. This paper investigates how classical inference and learning tasks known …

[图书][B] Handbook of knowledge representation

F Van Harmelen, V Lifschitz, B Porter - 2008 - books.google.com
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

On probabilistic inference by weighted model counting

M Chavira, A Darwiche - Artificial Intelligence, 2008 - Elsevier
A recent and effective approach to probabilistic inference calls for reducing the problem to
one of weighted model counting (WMC) on a propositional knowledge base. Specifically, the …

[PDF][PDF] New advances in compiling CNF to decomposable negation normal form

A Darwiche - Proc. of ECAI, 2004 - Citeseer
We describe a new algorithm for compiling conjunctive normal form (CNF) into Deterministic
Decomposable Negation Normal (d-DNNF), which is a tractable logical form that permits …

[PDF][PDF] Probabilistic sentential decision diagrams

D Kisa, G Van den Broeck, A Choi… - … Conference on the …, 2014 - cdn.aaai.org
Abstract We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and
canonical representation of probability distributions defined over the models of a given …

[PDF][PDF] Performing Bayesian inference by weighted model counting

T Sang, P Beame, HA Kautz - AAAI, 2005 - cdn.aaai.org
Over the past decade general satisfiability testing algorithms have proven to be surprisingly
effective at solving a wide variety of constraint satisfaction problem, such as planning and …

[PDF][PDF] Lifted first-order probabilistic inference

R Braz, E Amir, D Roth - Proceedings of the Nineteenth International Joint …, 2005 - Citeseer
There has been a long standing division in AI between logical symbolic and probabilistic
reasoning approaches. While probabilistic models can deal well with inherent uncertainty in …

[PDF][PDF] Lifted probabilistic inference by first-order knowledge compilation

G Van den Broeck, N Taghipour, W Meert, J Davis… - IJCAI, 2011 - starai.cs.ucla.edu
Probabilistic logical languages provide powerful formalisms for knowledge representation
and learning. Yet performing inference in these languages is extremely costly, especially if it …

Scaling exact inference for discrete probabilistic programs

S Holtzen, G Van den Broeck, T Millstein - Proceedings of the ACM on …, 2020 - dl.acm.org
Probabilistic programming languages (PPLs) are an expressive means of representing and
reasoning about probabilistic models. The computational challenge of probabilistic …

Survey on models and techniques for root-cause analysis

M Solé, V Muntés-Mulero, AI Rana… - arXiv preprint arXiv …, 2017 - arxiv.org
Automation and computer intelligence to support complex human decisions becomes
essential to manage large and distributed systems in the Cloud and IoT era. Understanding …