The following pages link to (Q4533365):
Displayed 44 items.
- The distribution semantics for normal programs with function symbols (Q313122) (← links)
- Exploiting symmetries for scaling loopy belief propagation and relational training (Q374162) (← links)
- Constraint-based probabilistic modeling for statistical abduction (Q413868) (← links)
- Gradient-based boosting for statistical relational learning: the relational dependency network case (Q439014) (← links)
- Applying the information bottleneck to statistical relational learning (Q439020) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- The well-designed logical robot: learning and experience from observations to the Situation Calculus (Q543604) (← links)
- Bayesian learning of Bayesian networks with informative priors (Q841633) (← links)
- Variational Bayes via propositionalized probability computation in PRISM (Q841638) (← links)
- Learning first-order probabilistic models with combining rules (Q841645) (← links)
- Probabilistic (logic) programming concepts (Q894692) (← links)
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs (Q894703) (← links)
- An OpenCL implementation of a forward sampling algorithm for CP-logic (Q900368) (← links)
- Learning failure-free PRISM programs (Q900370) (← links)
- Compressing probabilistic Prolog programs (Q1009237) (← links)
- ALLPAD: approximate learning of logic programs with annotated disjunctions (Q1009241) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control (Q1726305) (← links)
- Learning to rank in PRISM (Q1726418) (← links)
- Online Bayesian inference for the parameters of PRISM programs (Q1945138) (← links)
- Speeding up parameter and rule learning for acyclic probabilistic logic programs (Q1999576) (← links)
- Inductive logic programming at 30 (Q2127222) (← links)
- Handling epistemic and aleatory uncertainties in probabilistic circuits (Q2163184) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Distributional logic programming for Bayesian knowledge representation (Q2374510) (← links)
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (Q2390651) (← links)
- A new approach to hybrid probabilistic logic programs (Q2642628) (← links)
- Logic-Based Probabilistic Modeling (Q3638275) (← links)
- Constraint-Based Inference in Probabilistic Logic Programs (Q4559821) (← links)
- Introduction to the special issue on probability, logic and learning (Q4592975) (← links)
- Viterbi training in PRISM (Q4592976) (← links)
- Structure learning of probabilistic logic programs by searching the clause space (Q4592977) (← links)
- Non-discriminating Arguments and Their Uses (Q4649724) (← links)
- Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis (Q4649725) (← links)
- Optimizing Probabilities in Probabilistic Logic Programs (Q5019596) (← links)
- (Q5020546) (← links)
- (Q5240217) (← links)
- Probabilistic Inductive Logic Programming (Q5452020) (← links)
- New Advances in Logic-Based Probabilistic Modeling by PRISM (Q5452024) (← links)
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge (Q5452025) (← links)
- Basic Principles of Learning Bayesian Logic Programs (Q5452026) (← links)
- The Independent Choice Logic and Beyond (Q5452027) (← links)
- On the Efficient Execution of ProbLog Programs (Q5504655) (← links)
- Learning Distributional Programs for Relational Autocompletion (Q6063874) (← links)