Declarative probabilistic logic programming in discrete-continuous domains

DOI10.1016/J.ARTINT.2024.104227MaRDI QIDQ6665698zbMATH OpenFDO

Authors Pedro Zuidberg Dos Martires, Luc De Raedt, Angelika Kimmig

Publication date 17 January 2025

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

logic programmingknowledge compilationprobabilistic programmingdeclarative semanticsdiscrete-continuous distributionslikelihood weightingalgebraic model counting

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3165828 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 7102019 (Why is no real title available?)
• scientific article; zbMATH DE number 4189220 (Why is no real title available?)
• A new probabilistic constraint logic programming language based on a generalised distribution semantics
• A semantics for hybrid probabilistic logic programs with function symbols
• Algebraic model counting
• Bayesian Estimates of Equation System Parameters: An Application of Integration by Monte Carlo
• Dedicated tabling for a probabilistic setting
• From statistical relational to neurosymbolic artificial intelligence: a survey
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Inference in probabilistic logic programs with continuous random variables
• Logic tensor networks
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Principles of uncertainty
• Probabilistic (logic) programming concepts
• Probabilistic Horn abduction and Bayesian networks
• Probabilistic logic programming for hybrid relational domains
• Probabilistic programming languages: independent choices and deterministic systems
• Probability Theory
• Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
• Statistical relational artificial intelligence: logic, probability, and computation
• Syntactic requirements for well-defined hybrid probabilistic logic programs
• The PITA system: tabling and answer subsumption for reasoning under uncertainty
• The complexity of computing the permanent
• The magic of logical inference in probabilistic programming

Cited in

(4)

• Semirings for probabilistic and neuro-symbolic logic programming
• First-order context-specific likelihood weighting in hybrid probabilistic logic programs
• Syntactic requirements for well-defined hybrid probabilistic logic programs
• Generative Datalog with continuous distributions

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)