Parallel abductive query answering in probabilistic logic programs

DOI10.1145/2480759.2480764MaRDI QIDQ2946697zbMATH OpenOpenAlexWikidataFDO

Authors Gerardo Simari, John P. Dickerson, Amy Sliva, V. S. Subrahmanian

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2480759.2480764

zbMATH Keywords

imprecise probabilitiesprobabilistic reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Recommendations

• Abductive inference in probabilistic logic programs
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• Focused most probable world computations in probabilistic logic programs
• Probabilistic logic programming with conditional constraints
• Complexity results for probabilistic answer set programming

Cited in

(7)

• Abductive inference in probabilistic logic programs
• Focused most probable world computations in probabilistic logic programs
• Super-Solutions
• Optimizing probabilities in probabilistic logic programs
• An OpenCL implementation of a forward sampling algorithm for CP-logic
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• Abduction with probabilistic logic programming under the distribution semantics

This page was built for publication: Parallel abductive query answering in probabilistic logic programs

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