Sampling-based SAT/ASP multi-model optimization as a framework for probabilistic inference

DOI10.1007/978-3-319-99960-9_6zbMATH Open1455.68193OpenAlexW2888185943MaRDI QIDQ5149786FDOQ5149786

Authors Matthias Nickles

Publication date 8 February 2021

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99960-9_6

zbMATH Keywords

answer set programmingnumerical optimizationSATprobabilistic logic programmingprojective gradient descentrelational AI

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Logic programming (68N17)

Recommendations

• Distribution-aware sampling of answer sets
• Probabilistic Reasoning by SAT Solvers
• Optimizing probabilities in probabilistic logic programs
• Probabilistic inference by hashing and optimization
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs

Cited in

(5)

• Distribution-aware sampling of answer sets
• Improving the efficiency of Gibbs sampling for probabilistic logical models by means of program specialization
• Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
• A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
• Semiring programming: a semantic framework for generalized sum product problems

This page was built for publication: Sampling-based SAT/ASP multi-model optimization as a framework for probabilistic inference

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