• Aucun résultat trouvé

Optimizing Inference for Probabilistic Logic Programs Exploiting Independence and Exclusiveness

N/A
N/A
Protected

Academic year: 2022

Partager "Optimizing Inference for Probabilistic Logic Programs Exploiting Independence and Exclusiveness"

Copied!
15
0
0

Texte intégral

Références

Documents relatifs

In this work we present an algorithm called Deep Parameter learning for HIerarchical probabilistic Logic pro- grams (DPHIL) that learns hierarchical PLP parameters using

When compared to pure reference silica aerogel, the average particle concentration went down significantly for the EP-M 95 hybrid aerogels with increasing concentrations..

Cette micrographie nous permet de constater l’état poreux de l’échantillon avec la présence de grains ayant une forme particulière et qui rappellent la rosace ou plutôt une

As stated in the Introduction, the dependencies between random variables implicit in the control and data flow of a PLP, and the impossibility of completely representing the set of

We have introduced T P -compilation, a novel anytime in- ference approach for probabilistic logic programs that com- bines the advantages of forward reasoning with state-of-the-

– We presented an argumentation semantics of defeasible logic programs, based on conflict resolution strategies within assumption-based frameworks, whose semantics satisfies

When termination and non-termination analysis produce complementary results for a logic procedure, then with respect to the leftmost selection rule and the language used to

stead of diretly desribing the syntax of language via a formal grammar, the.. linguist speies the strutures of this formal grammar using a