Credal Networks under Maximum Entropy
<p>In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by defining probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an efficient linear programmi...
Päätekijä: | Lukasiewicz, T |
---|---|
Aineistotyyppi: | Conference item |
Julkaistu: |
Morgan Kaufmann
2000
|
Samankaltaisia teoksia
-
Probabilistic Logic Programming under Maximum Entropy
Tekijä: Lukasiewicz, T, et al.
Julkaistu: (1999) -
Robustness guarantees for credal Bayesian networks via constraint relaxation over probabilistic circuits
Tekijä: Wijk, H, et al.
Julkaistu: (2022) -
Combining Probabilistic Logic Programming with the Power of Maximum Entropy
Tekijä: Kern−Isberner, G, et al.
Julkaistu: (2004) -
Maximum Entropy Discrimination
Tekijä: Jaakkola, Tommi, et al.
Julkaistu: (2004) -
The maximum entropy formalism /
Tekijä: Maximum Entropy Formalism Conference (1978 : Massachussetts Institute of Technology), et al.
Julkaistu: (1978)