Declarative probabilistic logic programming in discrete-continuous domains

DOI10.1016/J.ARTINT.2024.104227MaRDI QIDQ6665698

Angelika Kimmig, Luc De Raedt, Pedro Zuidberg Dos Martires

Publication date: 17 January 2025

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

logic programmingprobabilistic programmingknowledge compilationdeclarative semanticsdiscrete-continuous distributionslikelihood weightingalgebraic model counting

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of computing the permanent
• Probabilistic (logic) programming concepts
• A new probabilistic constraint logic programming language based on a generalised distribution semantics
• Probabilistic Horn abduction and Bayesian networks
• A semantics for hybrid probabilistic logic programs with function symbols
• Algebraic model counting
• Probabilistic logic programming for hybrid relational domains
• Logic tensor networks
• Statistical Relational Artificial Intelligence: Logic, Probability, and Computation
• Dedicated tabling for a probabilistic setting
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty
• The magic of logical inference in probabilistic programming
• Bayesian Estimates of Equation System Parameters: An Application of Integration by Monte Carlo
• Probability Theory
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Semantics for probabilistic programming
• Inference in probabilistic logic programs with continuous random variables
• From statistical relational to neurosymbolic artificial intelligence: a survey
• Syntactic requirements for well-defined hybrid probabilistic logic programs

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)