Lifted algorithms for symmetric weighted first-order model sampling
From MaRDI portal
Publication:6566639
DOI10.1016/J.ARTINT.2024.104114MaRDI QIDQ6566639FDOQ6566639
Authors: Yuanhong Wang, Juhua Pu, Yuyi Wang, Ondřej Kuželka 
Publication date: 3 July 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- The complexity of computing the permanent
- Random generation of combinatorial structures from a uniform distribution
- Probabilistic planning via heuristic forward search and weighted model counting
- The Complexity of Enumeration and Reliability Problems
- The Kolmogorov-Smirnov Test for Goodness of Fit
- On probabilistic inference by weighted model counting
- Markov logic networks
- Lifted generative learning of Markov logic networks
- On the Decision Problem for Two-Variable First-Order Logic
- On Counting Independent Sets in Sparse Graphs
- On the tight constant in the multivariate Dvoretzky-Kiefer-Wolfowitz inequality
- Sampling Regular Graphs and a Peer-to-Peer Network
- Lower complexity bounds for lifted inference
- Uniform sampling through the Lovász local lemma
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
- Title not available (Why is that?)
- Sampling constraint satisfaction solutions in the local lemma regime
- Lifted variable elimination: decoupling the operators from the constraint language
- Weighted model counting beyond two-variable logic
- Weighted first-order model counting in the two-variable fragment with counting quantifiers
Cited In (1)
This page was built for publication: Lifted algorithms for symmetric weighted first-order model sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566639)
