<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Inference for Probabilistic Logic Programming with Continuous Distributions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Arjen Hommersom</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Open University of the Netherlands, Department of Computer Science</institution>
          ,
          <addr-line>Heerlen</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Probabilistic logics combine the expressive power of logic with the ability
to reason with uncertainty. Given the discrete nature of logical languages, it
is natural to use these languages for modelling discrete distributions. However,
for many practical applications, both discrete and continuous distributions are
required. In this talk, I will discuss several approaches for dealing with continuous
distributions as part of a PLP language. Furthermore, I will discuss in more detail
our recent PLP approach for dealing with continuous distributions by means of
probability intervals. In particular, the Interative Hybrid Probabilistic Model
Counting (IHPMC) algorithm will be discussed, which enables approximating
a large class of hybrid problems with a bounded error. It has been shown that
the current implementation can outperform current sampling implementation,
in particular when the programs contain sufficient logical structure.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>