Focused most probable world computations in probabilistic logic programs

DOI10.1007/S10472-012-9285-YzbMATH Open1260.68393OpenAlexW2074797512MaRDI QIDQ454145

Gerardo Simari, Amy Sliva, V. S. Subrahmanian, Maria Vanina Martinez

Publication date: 1 October 2012

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

Full work available at URL: https://doi.org/10.1007/s10472-012-9285-y

zbMATH Keywords

Monte Carlo samplingimprecise probabilitiesmost probable worldsprobabilistic logic program

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic logic
• Heterogeneous active agents, I: Semantics
• Column Generation Methods for Probabilistic Logic
• A logic for reasoning about probabilities
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• Probabilistic logic programming
• Mathematical Aspects of Mixing Times in Markov Chains
• An analysis of first-order logics of probability
• Quantitative deduction and its fixpoint theory
• Probability logic
• Combining probabilistic logic programming with the power of maximum entropy
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• COBA 2.0: A Consistency-Based Belief Change System
• Hybrid probabilistic programs

Cited In (1)

• Belief revision in structured probabilistic argumentation, model and application to cyber security

Uses Software

• QSopt-Exact
• Sat4j
• ProbView

This page was built for publication: Focused most probable world computations in probabilistic logic programs

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