Using histograms to better answer queries to probabilistic logic programs

DOI10.1007/978-3-642-02846-5_9MaRDI QIDQ4649723zbMATH OpenOpenAlexFDO

Authors Matthias Broecheler, Gerardo Simari, V. S. Subrahmanian

Publication date 13 November 2012

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02846-5_9

zbMATH Keywords

imprecise probabilitiesprobabilistic logic programming

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Logic programming (68N17)

Recommendations

• Probabilistic logic programming with conditional constraints
• Constraint-based inference in probabilistic logic programs
• On the semantics and complexity of probabilistic logic programs
• MAP inference for probabilistic logic programming
• Probabilistic logic programming

Cites work

• scientific article; zbMATH DE number 1538124 (Why is no real title available?)
• A logic for reasoning about probabilities
• A random polynomial-time algorithm for approximating the volume of convex bodies
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Combining probabilistic logic programming with the power of maximum entropy
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• Hit-and-run from a corner
• Logic Programming
• Mathematical aspects of mixing times in Markov chains.
• On the Complexity of Computing the Volume of a Polyhedron
• Probabilistic logic
• Probabilistic logic programming
• Probability logic
• Quantitative deduction and its fixpoint theory
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• The problem of calculating the volume of a polyhedron is enumerably hard
• Two Algorithms for Determining Volumes of Convex Polyhedra

Cited in

(5)

• Probabilistic characterisation of models of first-order theories
• Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics
• Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
• scientific article; zbMATH DE number 1759708 (Why is no real title available?)
• An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version)

This page was built for publication: Using histograms to better answer queries to probabilistic logic programs

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