Focused most probable world computations in probabilistic logic programs
type: Item
instance of: scholarly article
title: Focused most probable world computations in probabilistic logic programs
zbMATH Open document ID: 1260.68393
author: Gerardo Simari
author: Maria Vanina Martinez
author: Amy Sliva
author: V. S. Subrahmanian
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2012-10-01T00:00:00Z
review text: The paper develops an approach based on action probabilistic logic programs. The first two sections give an introduction to the topic and present basic notions that are used further in the article. Section 3 is dedicated to ``a new linear program formulation for worlds of interest''. Starting from a basic ap-program a set of linear constraints is associated; the constraints are defined over the set of all possible worlds of interest. An algorithm to refine the constraints is presented and analyzed in terms of the running time. In the second part of this section, refinement algorithms based on the Monte Carlo technique are analyzed. The experimental results from Section 4 show that the system proposed performs well. Related work and conclusions finish the paper.
reviewed by: Ion Iancu
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 6088735
zbMATH Keywords: probabilistic logic program
zbMATH Keywords: imprecise probabilities
zbMATH Keywords: most probable worlds
zbMATH Keywords: Monte Carlo sampling
describes a project that uses: QSopt-Exact
describes a project that uses: Sat4j
describes a project that uses: ProbView
MaRDI profile type: Publication
full work available at URL: s10472-012-9285-y
OpenAlex ID: W2074797512
cites work: Q4955340
cites work: Hybrid probabilistic programs
cites work: COBA 2.0: A Consistency-Based Belief Change System
cites work: Heterogeneous active agents, I: Semantics
cites work: A logic for reasoning about probabilities
cites work: Probability logic
cites work: An analysis of first-order logics of probability
cites work: Column Generation Methods for Probabilistic Logic
cites work: Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
cites work: Q3992908
cites work: Combining probabilistic logic programming with the power of maximum entropy
cites work: Mathematical Aspects of Mixing Times in Markov Chains
cites work: A semantical framework for supporting subjective and conditional probabilities in deductive databases
cites work: Probabilistic logic programming
cites work: Probabilistic logic
cites work: Quantitative deduction and its fixpoint theory
DOI: 10.1007/S10472-012-9285-Y
description: scientific article; zbMATH DE number 6088735