REVIEW 2 cited by
Parallel Weighted Model Counting with Tensor Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A promising new algebraic approach to weighted model counting makes use of tensor networks, following a reduction from weighted model counting to tensor-network contraction. Prior work has focused on analyzing the single-core performance of this approach, and demonstrated that it is an effective addition to the current portfolio of weighted-model-counting algorithms. In this work, we explore the impact of multi-core and GPU use on tensor-network contraction for weighted model counting. To leverage multiple cores, we implement a parallel portfolio of tree-decomposition solvers to find an order to contract tensors. To leverage a GPU, we use TensorFlow to perform the contractions. We compare the resulting weighted model counter on 1914 standard weighted model counting benchmarks and show that it significantly improves the virtual best solver.
Forward citations
Cited by 2 Pith papers
-
Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs
Tensor trains are provably more succinct than OBDDs as Boolean function representations and support the same polynomial-time queries and transformations.
-
CSB: A Counting and Sampling tool for Bit-vectors
Bit-blasting bit-vector formulas to CNF and calling modern CNF counters/samplers yields a practical first tool for exact, projected, and uniform sampling over QF_BV.
Discussion (0). Continue with ORCID to comment.