Probabilistic abductive logic programming using Dirichlet priors

DOI10.1016/J.IJAR.2016.07.001zbMATH Open1386.68163OpenAlexW2467782716MaRDI QIDQ324690FDOQ324690

Luke Dickens, Calin Rares Turliuc, Alessandra Russo, Krysia Broda

Publication date: 17 October 2016

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2016.07.001

zbMATH Keywords

Markov chain Monte Carloabductive logic programminglatent Dirichlet allocationprobabilistic programmingrepeated insertion model

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• 10.1162/jmlr.2003.3.4-5.993
• Hierarchical Dirichlet Processes
• Abductive Logic Programming
• Binary Decision Diagrams
• The repeated insertion model for rankings: missing link between two subset choice models
• On Minimality and Integrity Constraints in Probabilistic Abduction
• A kripke-kleene semantics for logic programs*
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• New Advances in Logic-Based Probabilistic Modeling by PRISM

Cited In (1)

• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference

Uses Software

• ProbLog
• BUGS
• Church
• Stan
• SICStus
• Figaro

This page was built for publication: Probabilistic abductive logic programming using Dirichlet priors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324690)