BLOG
From MaRDI portal
Software:33822
swMATH22025MaRDI QIDQ33822FDOQ33822
Author name not available (Why is that?)
Cited In (39)
- Probabilistic logic programming for hybrid relational domains
- MEBN: a language for first-order Bayesian knowledge bases
- The Bayesian logic of frequency-based conjunction fallacies
- Modelling relational statistics with Bayes nets
- Stochastic representation and recognition of high-level group activities
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- Probabilistic modelling, inference and learning using logical theories
- The well-designed logical robot: learning and experience from observations to the Situation Calculus
- Probabilities on sentences in an expressive logic
- Semiring programming: a semantic framework for generalized sum product problems
- Mixed deterministic and probabilistic networks
- Reference classes and relational learning
- Stochastic process semantics for dynamical grammars
- Probabilistic Programming Language and its Incremental Evaluation
- Learning Probabilistic Logic Programs over Continuous Data
- The distribution semantics for normal programs with function symbols
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Probabilistic reasoning in a classical logic
- Lower complexity bounds for lifted inference
- Poisson dependency networks: gradient boosted models for multivariate count data
- Measure transformer semantics for Bayesian machine learning
- Robot location estimation in the situation calculus
- Title not available (Why is that?)
- REBA: A Refinement-Based Architecture for Knowledge Representation and Reasoning in Robotics
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- A new approach for conditioning process-based geologic models to well data
- Probabilistic (logic) programming concepts
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
- Probabilistic sentence satisfiability: an approach to PSAT
- Planning in hybrid relational MDPs
- Regression and progression in stochastic domains
- Title not available (Why is that?)
- kProbLog: an algebraic Prolog for machine learning
- Thirty years of credal networks: specification, algorithms and complexity
- Lifted graphical models: a survey
- Analysis of a probabilistic model of redundancy in unsupervised information extraction
- PR-OWL - a language for defining probabilistic ontologies
- The complexity of Bayesian networks specified by propositional and relational languages
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
This page was built for software: BLOG