Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
type: Item
instance of: scholarly article
title: Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
zbMATH Open document ID: 1138.68054
author: Samir Khuller
author: Dana Nau
author: Amy Sliva
author: Gerardo Simari
author: V. S. Subrahmanian
author: Maria Vanina Martinez
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2008-04-21T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 5265507
zbMATH Keywords: Uncertainty
zbMATH Keywords: Probabilistic logic programs
zbMATH Keywords: Most probable worlds
zbMATH Keywords: Scalable approximations
MaRDI profile type: MaRDI publication profile
full work available at URL: s10472-008-9089-2
OpenAlex ID: W2059890614
cites work: Q4955340
cites work: Hybrid probabilistic programs
cites work: Heterogeneous active agents, I: Semantics
cites work: A logic for reasoning about probabilities
cites work: Probability logic
cites work: Column Generation Methods for Probabilistic Logic
cites work: Combining probabilistic logic programming with the power of maximum entropy
cites work: Q3992908
cites work: Probabilistic logic
cites work: A semantical framework for supporting subjective and conditional probabilities in deductive databases
cites work: Probabilistic logic programming
cites work: Quantitative deduction and its fixpoint theory
DOI: 10.1007/S10472-008-9089-2
description: scientific article; zbMATH DE number 5265507