Declarative probabilistic logic programming in discrete-continuous domains
From MaRDI portal
Publication:6665698
DOI10.1016/J.ARTINT.2024.104227MaRDI QIDQ6665698FDOQ6665698
Authors: Pedro Zuidberg Dos Martires, Luc De Raedt, Angelika Kimmig
Publication date: 17 January 2025
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
- A semantics for hybrid probabilistic logic programs with function symbols
- Probabilistic logic programming for hybrid relational domains
- Extending ProbLog with Continuous Distributions
- Inference in probabilistic logic programs with continuous random variables
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
logic programmingknowledge compilationprobabilistic programmingdeclarative semanticsdiscrete-continuous distributionslikelihood weightingalgebraic model counting
Cites Work
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability Theory
- The complexity of computing the permanent
- Bayesian Estimates of Equation System Parameters: An Application of Integration by Monte Carlo
- Title not available (Why is that?)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Probabilistic Horn abduction and Bayesian networks
- Probabilistic (logic) programming concepts
- Probabilistic logic programming for hybrid relational domains
- The magic of logical inference in probabilistic programming
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Inference in probabilistic logic programs with continuous random variables
- Title not available (Why is that?)
- Dedicated tabling for a probabilistic setting
- Probabilistic programming languages: independent choices and deterministic systems
- Principles of uncertainty
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- Algebraic model counting
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Statistical relational artificial intelligence: logic, probability, and computation
- A semantics for hybrid probabilistic logic programs with function symbols
- Title not available (Why is that?)
- Logic tensor networks
- From statistical relational to neurosymbolic artificial intelligence: a survey
- Syntactic requirements for well-defined hybrid probabilistic logic programs
Cited In (4)
This page was built for publication: Declarative probabilistic logic programming in discrete-continuous domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665698)