scientific article; zbMATH DE number 1753155
From MaRDI portal
Publication:4533365
zbMath0994.68025MaRDI QIDQ4533365
Taisuke Sato, Yoshitaka Kameya
Publication date: 10 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (44)
Inductive logic programming at 30 ⋮ Distributional logic programming for Bayesian knowledge representation ⋮ Bayesian learning of Bayesian networks with informative priors ⋮ Variational Bayes via propositionalized probability computation in PRISM ⋮ Learning first-order probabilistic models with combining rules ⋮ The distribution semantics for normal programs with function symbols ⋮ A new approach to hybrid probabilistic logic programs ⋮ Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence ⋮ Constraint-Based Inference in Probabilistic Logic Programs ⋮ Handling epistemic and aleatory uncertainties in probabilistic circuits ⋮ Exploiting symmetries for scaling loopy belief propagation and relational training ⋮ Unnamed Item ⋮ Learning Distributional Programs for Relational Autocompletion ⋮ Introduction to the special issue on probability, logic and learning ⋮ Viterbi training in PRISM ⋮ Structure learning of probabilistic logic programs by searching the clause space ⋮ Probabilistic (logic) programming concepts ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Constraint-based probabilistic modeling for statistical abduction ⋮ An OpenCL implementation of a forward sampling algorithm for CP-logic ⋮ Learning failure-free PRISM programs ⋮ Online Bayesian inference for the parameters of PRISM programs ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Gradient-based boosting for statistical relational learning: the relational dependency network case ⋮ Applying the information bottleneck to statistical relational learning ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Unnamed Item ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ Learning to rank in PRISM ⋮ Non-discriminating Arguments and Their Uses ⋮ Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis ⋮ On the complexity of propositional and relational credal networks ⋮ Speeding up parameter and rule learning for acyclic probabilistic logic programs ⋮ The well-designed logical robot: learning and experience from observations to the Situation Calculus ⋮ Probabilistic Inductive Logic Programming ⋮ New Advances in Logic-Based Probabilistic Modeling by PRISM ⋮ CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge ⋮ Basic Principles of Learning Bayesian Logic Programs ⋮ The Independent Choice Logic and Beyond ⋮ Compressing probabilistic Prolog programs ⋮ ALLPAD: approximate learning of logic programs with annotated disjunctions ⋮ Logic-Based Probabilistic Modeling ⋮ On the Efficient Execution of ProbLog Programs ⋮ Optimizing Probabilities in Probabilistic Logic Programs
Uses Software
This page was built for publication:
