BLOG
From MaRDI portal
Cited in
(87)- CrossMine
- GOLOG
- WHIRL
- MEBN
- IMPACT
- PR-OWL - a language for defining probabilistic ontologies
- Planning in hybrid relational MDPs
- kProbLog: an algebraic Prolog for machine learning
- The complexity of Bayesian networks specified by propositional and relational languages
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- A new approach for conditioning process-based geologic models to well data
- ProbLog
- CP-logic
- PITA
- FluCaP
- IBAL
- Church
- FACTORIE
- Cellerator
- Thirty years of credal networks: specification, algorithms and complexity
- Semiring programming: a semantic framework for generalized sum product problems
- Modelling relational statistics with Bayes nets
- FPsolve
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- Probabilistic sentence satisfiability: an approach to PSAT
- Regression and progression in stochastic domains
- Lifted graphical models: a survey
- MEBN: a language for first-order Bayesian knowledge bases
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
- Probabilistic reasoning in a classical logic
- SPOOK
- Probabilities on sentences in an expressive logic
- foxPSL
- Probabilistic logic programming for hybrid relational domains
- Hakaru
- PREGO
- kProbLog
- Snowball
- The distribution semantics for normal programs with function symbols
- Probabilistic programming language and its incremental evaluation
- LMS
- MayBMS
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- KnowRob
- VERL
- PR-OWL
- MGS
- cplint
- MCINTYRE
- Dyna
- kFOIL
- PRISM
- HyPER
- ClaimEval
- Swift
- GenPSAT
- HBC
- Tuffy
- Figaro
- Stochastic representation and recognition of high-level group activities
- REBA
- ALM
- Blaise
- UnBBayes
- Anglican
- Reference classes and relational learning
- BRECCIA
- Lower complexity bounds for lifted inference
- Hinge-loss Markov random fields and probabilistic soft logic
- REBA: A Refinement-Based Architecture for Knowledge Representation and Reasoning in Robotics
- Learning probabilistic logic programs over continuous data
- On the probability and cost of ignorance, inconsistency, nonsense and more
- BayesOWL
- The Bayesian logic of frequency-based conjunction fallacies
- The well-designed logical robot: learning and experience from observations to the Situation Calculus
- FactorBase
- Measure transformer semantics for Bayesian machine learning
- Hakaru10
- Trio
- Poisson dependency networks: gradient boosted models for multivariate count data
- Mixed deterministic and probabilistic networks
- Probabilistic modelling, inference and learning using logical theories
- Stochastic process semantics for dynamical grammars
- Probabilistic (logic) programming concepts
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- Robot location estimation in the situation calculus
- Analysis of a probabilistic model of redundancy in unsupervised information extraction
This page was built for software: BLOG
