Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10³⁰,000 worlds

DOI10.1007/S10472-008-9089-2MaRDI QIDQ2426104zbMATH OpenOpenAlexFDO

Authors Samir Khuller, Dana Nau, Amy Sliva, Gerardo Simari, V. S. Subrahmanian, Maria Vanina Martinez

Publication date 21 April 2008

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-008-9089-2

zbMATH Keywords

Most probable worldsProbabilistic logic programsScalable approximationsUncertainty

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Focused most probable world computations in probabilistic logic programs
• Complexity results for probabilistic answer set programming
• Parallel abductive query answering in probabilistic logic programs
• Abductive inference in probabilistic logic programs
• MAP inference for probabilistic logic programming

Cites work

• A logic for reasoning about probabilities
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Column Generation Methods for Probabilistic Logic
• Combining probabilistic logic programming with the power of maximum entropy
• Heterogeneous active agents, I: Semantics
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1453067 (Why is no real title available?)
• Hybrid probabilistic programs
• Probabilistic logic
• Probabilistic logic programming
• Probability logic
• Quantitative deduction and its fixpoint theory

Cited in

(9)

• An AGM-style belief revision mechanism for probabilistic spatio-temporal logics
• A quantitative approach to belief revision in structured probabilistic argumentation
• Abductive inference in probabilistic logic programs
• Parallel abductive query answering in probabilistic logic programs
• Products of weighted logic programs
• Focused most probable world computations in probabilistic logic programs
• Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
• Using histograms to better answer queries to probabilistic logic programs
• Belief revision in structured probabilistic argumentation, model and application to cyber security

This page was built for publication: Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds

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