Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programming

07/02/2018 ∙ by Pedro Zuidberg Dos Martires, et al. ∙ 0

In probabilistic reasoning, the traditionally discrete domain has been elevated to the hybrid domain encompassing additionally continuous random variables. Inference in the hybrid domain, however, usually necessitates to condone trade-offs on either the inference on discrete or continuous random variables. We introduce a novel approach based on weighted model integration and algebraic model counting that circumvents these trade-offs. We then show how it supports knowledge compilation and exact probabilistic inference. Moreover, we introduce the hybrid probabilistic logic programming language HAL-ProbLog, an extension of ProbLog, to which we apply our inference approach.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

One of the state-of-the art methods for probabilistic inference in graphical models and probabilistic programming reduces probabilistic inference to weighted model counting (WMC) [Chavira and Darwiche2008], and then employs WMC solvers based on knowledge compilation (KC) techniques [Darwiche and Marquis2002]

. Because weighted model counting applies only to discrete probability distributions, it has recently been extended towards weighted model integration (WMI)

[Belle, Passerini, and Van den Broeck2015, Morettin, Passerini, and Sebastiani2017] as to support also continuous distributions. However, to the best of the authors’ knowledge, knowledge compilation has not yet been used for weighted model integration. Indeed, current approaches to weighted model integration essentially use satisfiability modulo theory (SMT) solvers, usually restricted to linear arithmetic over the reals (SMT()). On the other hand, knowledge compilation has proven to be very effective, especially when many probabilistic queries need to be answered as the theory needs to be compiled only once.

The key contribution of this paper is that we show how standard KC techniques can be applied to solve weighted model integration problems, and that we incorporate such techniques in hybrid probabilistic logic programming languages. This is realized by casting weighted model integration within the framework of algebraic model counting (AMC) [Kimmig, Van den Broeck, and De Raedt2017]. AMC generalizes the standard weighted model counting problem to work with arbitrary semirings. More specifically, we make the following contributions:

  1. We introduce the probability density semiring.

  2. We show how this allows to cast WMI within AMC and thereby to use the general body of literature on knowledge compilation.

  3. We introduce Symbo, a solver for WMI that realizes knowledge compilation and exact symbolic inference.

Symbo exploits results by [Gehr, Misailovic, and Vechev2016] to simplify the algebraic expressions.

Algebraic model counting has also been incorporated in logic programming languages such as aProbLog [Kimmig, Van den Broeck, and De Raedt2011], which is an extension of the probabilistic programming language ProbLog [Fierens et al.2015] towards semirings and allows to state our next contribution.

  1. We use the probability density semiring within aProbLog to obtain a hybrid probabilistic logic programming language and implementation, that we dub hybrid algebraic ProbLog or HAL-ProbLog

HAL-ProbLog is related to the Distributional Clauses framework of [Gutmann, Jaeger, and De Raedt2011, Gutmann et al.2011, Nitti, De Laet, and De Raedt2016], differences and similarities are further discussed in subsection 5.2.

2 Preliminaries

2.1 Weighted Model Integration

While the well-known SAT problem is the problem of deciding whether there is a satisfying assignment to a logical formula or not, an SMT problem generalizes SAT and allows in addition to use expressions formulated in a background theory. Consider, for example, the following SMT theory :


where is a Boolean variable, while is a real-valued variable. SMT then answer the question whether or not there is a satisfying assignment to the formula for the variables and . In this paper we consider non-linear real arithmetic SMT formulas.

Definition 1.

(SMT() (non-linear real arithmetics)) Let denote the set of real values and the set of Boolean values. We then define SMT() theories as combinations by means of the standard Boolean operators of atomic propositions and of atomic formulas in the form . The are variables in and . Allowing only for restricts SMT() theories to SMT( (linear real arithmetics) theories. ∎

Consider again the theory (cf. Eq. 1). Assume that is distributed according to: and that the probability for being true is . Determining now the probability of the formula being true extends the SMT problem to weighted model integration. We introduce WMI following [Morettin, Passerini, and Sebastiani2017].

Definition 2.

(Weighted model integration (WMI)) Given is a set of Boolean variables, a set of real variables, a weight function , and an SMT formula , the weighted model integral (WMI) is


where we use the notation to denote the set of assignments to the variables in that satisfy .∎

Hence, when computing the weighted model integral (Eq. 2), we first integrate over all in a formula for each possible assignment to the Boolean variables holds and then sum up the values of the integrals. The weight function is used to map a set of variable assignments to their weight. The weight function usually factorizes as the product of the weights over the different variables, i.e., .

With the definition of WMI at hand, we can also produce the weighted model integral by integrating over the continuous random variables, while using the algebraic constraints as boundary conditions and weighting the integrals with the probability of the Boolean variables: .

2.2 Algebraic Model Counting

Definition 3.

(Weighted model counting (WMC)). WMC is the special case of weighted model integration where the set of real variables is empty: .∎

WMC is traditionally used for probabilistic inference in Bayesian networks

[Chavira and Darwiche2008] and probabilistic programming [Fierens et al.2015] with a factorized weight function: . Algebraic model counting [Kimmig, Van den Broeck, and De Raedt2017] generalizes WMC to commutative semirings. More formally,

Definition 4.

A commutative semiring is an algebraic structure such that (1) addition and multiplication are binary operations ; (2) addition and multiplication are associative and commutative binary operations over the set ; (3) distributes over ; (4) is the neutral element of ; (5) is the neutral element of ; and (6) is an annihilator for .∎

Definition 5.

(Algebraic model counting (AMC)) Given:

  • a propositional logic theory over a set of variables

  • a commutative semiring

  • a labeling function , mapping literals from the variables in to values from the semiring set

The algebraic model count of a theory is then defined as:

We use instead of and the term label rather than weight to reflect that the elements of the semiring cannot always be interpreted as weights.

[Kimmig, Van den Broeck, and De Raedt2017] show also under which conditions the an algebraic model count is a valid computation.

Definition 6.

(Neutral-sum property) A semiring addition and labeling function pair is neutral iff. .∎

Theorem 1.

(AMC on d-DNNF) Evaluating a d-DNNF representation of the propositional theory , using Algorithm 1 in [Kimmig, Van den Broeck, and De Raedt2017], for a semiring and labeling function with neutral tuple is a correct computation of the algebraic model count, cf. [Kimmig, Van den Broeck, and De Raedt2017]. ∎

2.3 Knowledge Compilation

Knowledge compilation [Darwiche and Marquis2002] is the process of transforming a propositional logic formula into a form that allows for polytime evaluation of the formula. Although the knowledge compilation step itself is computationally hard, the overall procedure yields a net benefit when a logical circuit has to be evaluated multiple times, possibly with different labels/weights for the literals.

A popular language to compile propositional formulas into are Sentential Decisions Diagrams (SDDs) [Choi, Kisa, and Darwiche2013]. SDDs are s a subset of d-DNNF formulas. We use SDDs to implement our solver, Symbo.

Note that, as SDDs are subset of d-DNNF, Theorem 1 holds also for the them.

3 The probability density semiring and WMI

Now we have all the ingredients to define the probability density semiring, which is needed to cast WMI as AMC.

The key difference between WMI and AMC is that in a WMI task there is first a sum, then an integral and then typically a product, while in AMC there is no integral. This intuitively implies that, if we want to cast WMI using AMC, we will have to perform the integration last: WMI = AMC. This can only be realized if we keep track of the two elements needed in the integral 1) the formula defining the values over which to integrate and 2) the weight function defining the densities according to which the variables in are distributed. So, the set of elements of semiring that we need to define will consist of tuples, where the first element will denote an algebraic expression and the second the weight function.

Definition 7.

(Labeling function ) If the literal represents either a Boolean variable or its negation then the label


where denotes the probability of the Boolean variable. Otherwise if the literal corresponds to an algebraic constraint within SMT(), depending on the set of real-valued continuous random variables , then the label of is given by:


denotes the set , where the are random variables and the the corresponding probability densities. The first definition in Eq. 4 is read as ‘l such that any is distributed according to the corresponding . ∎

The brackets around denote the so-called Iverson brackets. They evaluate to if their argument evaluates to true and to otherwise - they are a generalized indicator function.

We can now define the set of elements of the semiring:

Definition 8.

(Probability density semiring ) The elements of the semring are given by the set


where denotes any algebraic expression over , including also Iverson brackets. For instance, . is shorthand for the set with the set of all real-valued continuous random variables appearing in .
The neutral elements and are defined as:


For the addition and multiplication we define:


Lemma 1.

The structure is a commutative semiring.
Proof (Sketch). To prove that the structure actually constitutes a commutative semiring, we need to show that the properties in Definition 4 hold.

The proof relies on the commutativity and associativity of the Iverson brackets under standard addition and multiplication, and on the commutativity and associativity of the union operator for sets. Similarly for the distributivity of the multiplication over the addition (c.f. property ). Lastly, properties to are trivially satisfied. We conclude that the structure is indeed a commutative semiring. ∎

Lemma 2.

The pair is neutral.
Proof. Let be a literal with label iif. and iff. is an abstraction of an formula. We then have:

In the last line we used the fact that and are equivalent elements within the probability density semiring. ∎

Lemma 3.

(AMC on d-DNNF with ) The algebraic model count is a valid calculation on a d-DNNF representation of a logic formula given the density semiring
Proof. This follows immediately from Lemma 1 and 2, together with Theorem 1. ∎

An SMT() theory induces an infinity of theories, one for each possible instantiation of continuous random variables. We can utilize the same compiled theory for each of the infinitely many theories. Note that the probability of each instantiation is , as the support for a single instantiation is infinitesimally small. In order to retrieve actual probabilities from an SMT, we need to carry out the integration over the continuous random variables.

We show now how computing the algebraic model count in the semiring setting yields the probability of a theory being satisfied.

Theorem 2.

Let be an SMT() theory, a factorized weight function over the Boolean variables and continuous variables . Furthermore, assume that evaluates to in the semiring , with , where is an algebraic expression depending on the random variables . Then

is the product over the probability density function of the continuous random variables appearing in

Proof In the first step we re-write as the sum-product over the algebraic expression . We note also that the product over the density functions is actually the weight of the continuous random variables in WMI. In the second step (P2 to P3) we split up the sum and the product over the variables into sums over the Boolean and continuous random variables - likewise for the product. Next (P3 to P4) we push the product over the Boolean random variables through and note in (P5) that this product corresponds to the weight of the Boolean random variables in WMI.


In the last two lines, we exchanged the summation and integral, as Fubini’s theorem holds for summations/integrals over probability distributions and densities. The integral over the so-obtained sum-product is the integral over Iverson brackets. We rewrite the indefinite integral over the Iverson brackets as the definite integral having boundary conditions corresponding to the condition present in the Iverson brackets.

The last line (P7) corresponds to the definition of the weighted model integral. We have, hence, shown that WMI can be cast as an AMC task. ∎

4 Probability of SMT formulas via KC

We describe now Symbo, a symbolico-logic algorithm that produces the weighted model integral of an SMT() formula via knowledge compilation.

In Lemma 3 we saw that the probability semiring can be used to calculate the algebraic model count on a d-DNNF representation of a logical formula. Recalling Theorem 1, we are hence also capable of obtaining the weighted model integral of the a hybrid propositional formula, given the probability distributions of the random the variables.

At a high level, Symbo takes the following consecutive steps:

  1. Abstraction of algebraic constraints in in order to obtain . For instance, a constraint would be abstracted as a Bool .

  2. Compilation of into a d-DNNF representation .

  3. Transforming the logic formula into an arithmetic circuit .

  4. Labeling the literals in according to the labeling function given in Definition 7.

  5. Symbolically evaluating according to the probability density semiring .

  6. Symbolically multiplying the expression obtained from evaluating , which is a sum-product of weighted indicator functions (Iverson brackets), by the probability densities according to which the continuous random variables are distributed.

  7. Symbolically integrating out the continuous random variables.

Regarding more technical details of the algorithm: Symbo leverages the PSI-Solver [Gehr, Misailovic, and Vechev2016], a novel approach for exact symbolic analysis of probabilistic programs that carries out inference through symbolic reasoning111This includes, amongst others, algebraic simplifications and guard simplifications. See [Gehr, Misailovic, and Vechev2016] for a detailed discussion.. When evaluating a compiled hybrid theory, Symbo builds up a symbolic PSI expression for (cf. Theorem 1). The leaf nodes of the d-DNNF representation are annotated with algebraic expressions. A leaf corresponding to a Boolean literal receives a symbolic value for the probability of being satisfied and a leaf corresponding to an abstraction of an algebraic condition is expressed as a symbolic Iverson bracket. Internal logical nodes of the compiled theory (logical and/or operations) are mapped to the symbolic multiplication/addition of the PSI-Solver. The inference engine of the PSI-Solver tries to symbolically simplify resulting expressions as much as possible. Once the compiled circuit is evaluated, the final expression is multiplied by Symbo with the set of densities corresponding to the continuous random variables in . The symbolic integration is then again carried out by the PSI-Solver.

Lets look at an example. Consider our initial example in Eq. 1. Compiling it into d-DNNF form yields:


which is already a propositional formula in a d-DNNF representation. Such a hybrid formula, for which Symbo has kept track of the probabilities and weights involved, can be considered to be the input to the algorithm. We can represent it as a graph where the leaves represent the literals in the formula and internal nodes logical operation, cf. Figure 1. Evaluating this theory using the semantics of the probability semiring and the PSI-Solver yields the following result

Figure 1: Graphical representation of the propositional formula in Eq. 1.

Multiplying this expression by the probability density function for and carrying out the integral gives us the weighted model integral for the theory .

In PSI, terms of the form denote the function , which cannot be simplified any further.

We note that the symbolic inference engine underlying the PSI-Solver has until now only been used for imperative programing. The implementation of Symbo shows that the powerful symbolic inference engine can also be adopted for logic programming when making use of knowledge compilation.

5 HAL-ProbLog

Let us now define HAL-ProbLog, a hybrid probabilistic logic programming language based on the distributional clause semantics of [Gutmann et al.2011, Nitti, De Laet, and De Raedt2016]. By making use of the reduction of WMC to AMC, we can implement HAL-ProbLog as an instance of aProbLog [Kimmig, Van den Broeck, and De Raedt2011], which itself extends the semantics of ProbLog [Fierens et al.2015], a probabilistic logic programming language. While ProbLog solves the task of computing the probability of a certain query being true, aProbLog generalizes this to a variety of other tasks by deploying a semiring.

5.1 aProbLog

Definition 9.

(aProbLog program) An algebraic ProbLog program consists of: 1) a commutative semiring , 2) a finite set of ground algebraic facts , 3) a finite set BK of background knowledge clauses of the form where and the are logical atoms, and 4) a labeling function where contains all facts and their negation .

Following [Kimmig, Van den Broeck, and De Raedt2011], we also define an aProbLog query and the label of a resulting theory as follows.

Definition 10.

(aProbLog query) An aProbLog query is a finite set of algebraic literals and atoms from the Herbrand base (), i.e. the set of ground atoms that can be constructed from the predicates, functor and constant symbols of the program . The set of interpretations that makes the query true is defined as: .

Definition 11.

(Label of aProbLog query) The label of a query is the label of : .

5.2 Syntax and semantics of HAL-ProbLog

We now apply aProbLog to obtain HAL-Problog, which we first illustrate on a simple example modeling the behavior of a machine under different temperature conditions. This examples is an extension of the SMT formula in Eq. 1.

% chance of being a hot day
% chance of cooling not working
%temperature distribution

Looking at the program in Eq. 11, we observe two differences in comparison to orthodox ProbLog syntax. Firstly, we can describe not only Boolean random variables but also continuous random variables, and specify how the random variables are distributed. This is realized by statements of the form , which denotes that is a continuous random variable distributed according to whenever are true for a substitution that grounds the rule. We will use the shorthand (we read this given and … and ). In our example we have . The temperature random variable

is distributed according to a specific normal distribution given it being a hot day or not.

A second difference to ordinary ProbLog lies in allowing HAL-Problog to also encompasses conditional statements - allowing to define binary random variables that depend on continuous ones. Therefore, we utilize the two built-in predicates and . takes as first argument a variable and the second argument unifies with a symbol representing the value of the variable. The predicate denotes an Iverson bracket involving symbolic values. Note that HAL-ProbLog allows to deploy conditions such as the following: and . Whether programs involving such expression can be solved or not relies on the solver. Using Symbo as a solver only programs reducible to formulas are guaranteed to be solvable.

In order to obtain meaningful HAL-ProbLog programs, each possible world allows for only one possible definition of one and the same continuous random variable, this construct is similar to that of the Distributional Clauses [Nitti, De Laet, and De Raedt2016, Gutmann, Jaeger, and De Raedt2011]. This effectively means that, exactly as Distributional Clauses, we only allow for mixtures of continuous random variables and is guaranteed by requiring that rules with identical heads have mutually exclusive bodies, as in distributional clauses (see [Gutmann, Jaeger, and De Raedt2011] for formal details). Lifting this restrictions would necessitate to capture interactions between different worlds as convolutions [Lucas and Hommersom2015].

Contrary to Distributional Clauses, however, HAL-ProbLog allows for defining one and the same discrete random variable multiple times, which results in effectively encoding a noisy-or gate. On this stance, HAL-ProbLog inherits its semantics from (a)ProbLog.

We are now able to interpret the HAL-ProbLog example program: a situation is modeled where the machine breaks down given that the temperature rises above 30 degrees or given that there is no cooling and the temperature rises above 20 degrees. The probability density modeling the temperature depends on whether it is hoy or not.

Let’s move on by defining the semantics of the predicate. In the example in Eq. 11 we saw that one and the same random variable can be distributed according to different distributions , given mutually exclusive bodies . This entails that the value of the random variable depends on the world one is in. If we have now a predicate , then we accommodate for this fact by allowing the logic variable to unify with all symbolic values for : . In other words: unifies with the values of any . The different ’s are distinguishable by their mutually exclusive bodies . In our example, unifies with the value of the temperature given that it is a hot day and given that it is not a hot day.

Now we define the semantics of the predicate. Suppose that we have in a body of a clause an Iverson predicate , where the algebraic condition depends on a set of logic variables . Then we add, for each ordered set of symbolic values that unifies with the ordered set of logic variables a clause of the following form to the program


Where we have the substitutions and . The ’s are the bodies of clauses that have as head the random variables , respectively. is short-hand for the set of distributions .

The following example shows the effect of this transformation on the program in Eq. 11.222The program in Eq. 13 is also labeling atoms in the heads of clauses, which is supported by the aProbLog implementation and which can easily be eliminated. (just introduce a new predicate that returns if the -th condition is true, and then replace the occurrences of by ).

Figure 2: Graphical representation of the HAL-ProbLog program in Eq. 11 compiled into an SDD.

We see that the Iverson predicate now functions as a literal. The transformation is finalized by removing the clauses whose head is a probability density from the program as they are no longer needed. This transformation is integrated within the aProbLog grounder (cf. section 5.3). Compiling the program in Eq. 13 into an SDD and calculating the probability of yields the following expression:

Grounding the Iverson predicates in a HAL-ProbLog program actually results in an aProbLog program. Therefore, we say that a HAL-ProbLog program is valid if grounding all Iverson predicates results in a valid aProbLog program, given the probability density semiring .

5.3 Implementation

We implemented HAL-ProbLog as an extension of the publicly available ProbLog2 system [Dries et al.2015]333 This system provides a state-of-the-art implementation of the ProbLog language which is accessible as a module in Python. The ProbLog system evaluates ProbLog models through the following pipeline: (1) reads the ProbLog model and transforms it into a clausal database representation, (2) generate a propositional and-or-graph representing the queries and evidence in the model using a built-in Prolog-based grounding engine, (3) transform the and-or-graph by removing cyclic dependencies (optional), (4) compile the model into an evaluatable form using knowledge compilation. Therefor we used SDDs, which are a subset of d-DNNF, as a target representation444 [Choi and Darwiche2013]. (5) perform weighted model counting on this formula to obtain the final probability of interest. The ProbLog2 system also provides an implementation of aProbLog by allowing custom semirings to be defined in the final step of the process.

In order to implement our system we extended the grounder (ProbLog’s step (2)) with support for the built-in that allows us to create dependencies of discrete random variables on continuous random variables. It adds a node to the ground formula for all possible combination of ground literals that the algebraic condition involved depends on, cf. Eq. 12. Moreover, our system deploys Symbo in ProbLog’s step (5) for evaluating compiled SMT() theories originating from hybrid HAL-ProbLog programs.

6 Experimental Evaluation

The question we would like to answer during the experimental evaluation is the following: How does solving hybrid probabilistic programs using Symbo, a logico-symbolic solver, compare to a pure, state-of-the-art, symbolic solver?

We answer this question by comparing HAL-ProbLog which uses Symbo to pure symbolic inference with the PSI-Solver in its native language. We compared Symbo and the PSI-Solver on the set of benchmark experiments given in section F of the Appendix in [Gehr, Misailovic, and Vechev2016].555cf.: Fun [Minka et al.2014] and R2 [Nori et al.2014]

Experiments were performed on a laptop Intel(R) i7 CPU 2.60GHz with 16 Gb memory.

In Table 1, we observe that Symbo outperforms the PSI-Solver on benchmarks, on even when including the time spend on the knowledge compilation step. Only for the ClickGraph benchmark PSI performs better than Symbo, which timed-out after s during the integration step. This is because PSI integrates out variables after loop iterations. This is not yet supported in HAL-ProbLog and Symbo ends up with a large symbolic expression that is hard to integrate over. This could be solved by, for example, using sub-queries in HAL-ProbLog, as can be done in ProbLog2.

It is generally beneficial to perform logical inference on top of symbolic inference in the hybrid and thereby also in the discrete domain.

Benchmark KC Evaluation PSI Domain
BurglarAlarm D
CoinBias H
Grass D
NoisyOR D
TwoCoins D
ClickGraph H
ClinicalTrial H
AddFun/max H
AddFun/sum H
MurderMystery D
Table 1: Knowledge compilation and arithmetic circuit evaluation times for Symbo, and problem solving time for PSI. Times are given in ms. Run times were averaged over 50 runs. The domain column indicates whether the problem is Discrete or Hybrid.

7 Related Work

While knowledge compilation with SDDs and other representations has been used for (WMC) in probabilistic graphical models [Choi, Kisa, and Darwiche2013] and probabilistic logic programming [Vlasselaer et al.2016], it has to the best of our knowledge, not yet been applied to support hybrid exact inference.

W.r.t. hybrid inference in probabilistic programming, there are basically two classes of approaches: approximate and exact. Firstly, for what concerns exact inference, there is the already mentioned work for imperative probabilistic programming [Gehr, Misailovic, and Vechev2016], which has contributed the PSI solver that we use in Symbo. Furthermore, our work shows that knowledge compilation can speed up the inference in PSI and that the resulting framework applies hybrid probabilistic logics, too. Another approach related to exact inference in probabilistic logic programming is that of [Islam, Ramakrishnan, and Ramakrishnan2012]. Similarly to Symbo, they symbolically evaluate a theory in order to obtain an expression for a probability density. However, their approach is restricted to Gaussian densities and more importantly it is built on top of Prism [Sato1995], which assumes that proofs are mutually exclusive, and which avoids the disjoint sum problem. As a consequence they do not support WMI in its full generality. Supporting WMI requires the KC step, which is not addressed in their work.

Secondly, for what concerns approximate inference, we have the sampling approaches in distibutional clauses by [Gutmann et al.2011, Nitti, De Laet, and De Raedt2016] and BLOG [Milch et al.2007]. For Distributional Clauses, one uses importance sampling to sample from probability distributions and densities alike, combined with likelihood weighting.

Approximate inference is also performed in [Michels, Hommersom, and Lucas2016]. In their work, a hybrid probabilistic problem is represented by so called hybrid probability trees. A node in the tree can then split up a continuous variable on an arbitrary value and for each child of the node an upper and lower probability bound can be calculated, which then gives upper and lower probability bounds at the splitting node. Going deeper in the tree yields tighter and tighter bounds.

Finally, there is the work on inference in weighted model integration [Belle, Passerini, and Van den Broeck2015, Morettin, Passerini, and Sebastiani2017], which handles probability densities by splitting them up (and thereby approximating) into piecewise polynomials and then carrying out exact inference. This is somewhat related also to [Gutmann, Jaeger, and De Raedt2011], who pursued a similar procedure by restricting distributions to Gaussians which can be chopped up into easily integrable pieces. In contrast to these works, we provide a much larger class of densities and constraints.

In this line of work [Belle et al.2016] also investigated component caching while performing a DPLL search when calculating a WMI and DPLL search is indeed related to knowledge compilation. However, the method proposed in their work is strictly limited to piecewise polynomials. We, again, completely lift this restrictions and are able to perform WMI via knowledge compilation on SMT() formulas using probability density functions instead of piecewise polynomials on SMT().

8 Conclusion

We have shown how knowledge compilation can be applied to the task of weighting model integration by leveraging algebraic model counting. We have also introduced an effective logico-symbolic solver based on this idea. Finally, we presented HAL-ProbLog, a probabilistic logic programming language that is capable of fully harnessing the logical structure underlying a hybrid probabilistic program through KC in the hybrid domain.

In future work we would like explore non-factorized weight functions in the context of knowledge compilation and weighted model integration. Especially, as these non-factorized weight functions are presently predominantly used, cf. [Morettin, Passerini, and Sebastiani2017].


  • [Belle et al.2016] Belle, V.; Van den Broeck, G.; Passerini, A.; et al. 2016. Component caching in hybrid domains with piecewise polynomial densities. In AAAI, 3369–3375.
  • [Belle, Passerini, and Van den Broeck2015] Belle, V.; Passerini, A.; and Van den Broeck, G. 2015. Probabilistic inference in hybrid domains by weighted model integration. In

    Proceedings of 24th International Joint Conference on Artificial Intelligence (IJCAI)

    , 2770–2776.
  • [Chavira and Darwiche2008] Chavira, M., and Darwiche, A. 2008. On probabilistic inference by weighted model counting. Artificial Intelligence 172(6):772 – 799.
  • [Choi and Darwiche2013] Choi, A., and Darwiche, A. 2013. Dynamic minimization of sentential decision diagrams. In AAAI.
  • [Choi, Kisa, and Darwiche2013] Choi, A.; Kisa, D.; and Darwiche, A. 2013. Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams. Berlin, Heidelberg: Springer Berlin Heidelberg. 121–132.
  • [Darwiche and Marquis2002] Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. J. Artif. Int. Res. 17(1):229–264.
  • [Dries et al.2015] Dries, A.; Kimmig, A.; Meert, W.; Renkens, J.; Van den Broeck, G.; Vlasselaer, J.; and De Raedt, L. 2015. ProbLog2: Probabilistic Logic Programming. Cham: Springer International Publishing. 312–315.
  • [Fierens et al.2015] Fierens, D.; Van den Broeck, G.; Renkens, J.; Shterionov, D.; Gutmann, B.; Thon, I.; Janssens, G.; and De Raedt, L. 2015. Inference and learning in probabilistic logic programs using weighted boolean formulas. Theory and Practice of Logic Programming 15(3):358–401.
  • [Gehr, Misailovic, and Vechev2016] Gehr, T.; Misailovic, S.; and Vechev, M. 2016. Psi: Exact symbolic inference for probabilistic programs. In International Conference on Computer Aided Verification, 62–83. Springer.
  • [Gutmann et al.2011] Gutmann, B.; Thon, I.; Kimmig, A.; Bruynooghe, M.; and De Raedt, L. 2011. The magic of logical inference in probabilistic programming. Theory and Practice of Logic Programming 11(4-5):663–680.
  • [Gutmann, Jaeger, and De Raedt2011] Gutmann, B.; Jaeger, M.; and De Raedt, L. 2011. Extending ProbLog with Continuous Distributions. Berlin, Heidelberg: Springer Berlin Heidelberg. 76–91.
  • [Islam, Ramakrishnan, and Ramakrishnan2012] Islam, M. A.; Ramakrishnan, C.; and Ramakrishnan, I. 2012. Inference in probabilistic logic programs with continuous random variables. Theory and Practice of Logic Programming 12(4-5):505–523.
  • [Kimmig, Van den Broeck, and De Raedt2011] Kimmig, A.; Van den Broeck, G.; and De Raedt, L. 2011. An algebraic prolog for reasoning about possible worlds. In AAAI.
  • [Kimmig, Van den Broeck, and De Raedt2017] Kimmig, A.; Van den Broeck, G.; and De Raedt, L. 2017. Algebraic model counting. Journal of Applied Logic 22:46–62.
  • [Lucas and Hommersom2015] Lucas, P. J. F., and Hommersom, A. 2015. Modeling the interactions between discrete and continuous causal factors in bayesian networks. International Journal of Intelligent Systems 30(3):209–235.
  • [Michels, Hommersom, and Lucas2016] Michels, S.; Hommersom, A.; and Lucas, P. J. F. 2016. Approximate probabilistic inference with bounded error for hybrid probabilistic logic programming. In IJCAI 2016.
  • [Milch et al.2007] Milch, B.; Marthi, B.; Russell, S.; Sontag, D.; Ong, D. L.; and Kolobov, A. 2007. BLOG: Probabilistic models with unknown objects. In Getoor, L., and Taskar, B., eds., Statistical Relational Learning. MIT Press.
  • [Minka et al.2014] Minka, T.; Winn, J.; Guiver, J.; Webster, S.; Zaykov, Y.; Yangel, B.; Spengler, A.; and Bronskill, J. 2014. Infer.NET 2.6. Microsoft Research Cambridge.
  • [Morettin, Passerini, and Sebastiani2017] Morettin, P.; Passerini, A.; and Sebastiani, R. 2017. Efficient weighted model integration via smt-based predicate abstraction. def 1(x1):x2.
  • [Nitti, De Laet, and De Raedt2016] Nitti, D.; De Laet, T.; and De Raedt, L. 2016. Probabilistic logic programming for hybrid relational domains. Machine Learning 103(3):407–449.
  • [Nori et al.2014] Nori, A. V.; Hur, C.-K.; Rajamani, S. K.; and Samuel, S. 2014. R2: An efficient mcmc sampler for probabilistic programs. In AAAI, 2476–2482.
  • [Sato1995] Sato, T. 1995. A statistical learning method for logic programs with distribution semantics. In IN PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP’95. Citeseer.
  • [Vlasselaer et al.2016] Vlasselaer, J.; den Broeck, G. V.; Kimmig, A.; Meert, W.; and Raedt, L. D. 2016. Tp-compilation for inference in probabilistic logic programs. International Journal of Approximate Reasoning 78:15 – 32.