Using histograms to better answer queries to probabilistic logic programs

DOI10.1007/978-3-642-02846-5_9zbMATH Open1251.68052OpenAlexW2100868594MaRDI QIDQ4649723FDOQ4649723

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

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

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)

Cites Work

• Probabilistic logic
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Two Algorithms for Determining Volumes of Convex Polyhedra
• Title not available (Why is that?)
• A logic for reasoning about probabilities
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• On the Complexity of Computing the Volume of a Polyhedron
• Hit-and-run from a corner
• Probabilistic logic programming
• Mathematical aspects of mixing times in Markov chains.
• 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
• Logic Programming
• The problem of calculating the volume of a polyhedron is enumerably hard

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
• Title not available (Why is that?)
• 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)