Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling
Ontology highlight
ABSTRACT: Given a Boolean formula, the problem of counting seeks to estimate the number of solutions of F while the problem of uniform sampling seeks to sample solutions uniformly at random. Counting and uniform sampling are fundamental problems in computer science with a wide range of applications ranging from constrained random simulation, probabilistic inference to network reliability and beyond. The past few years have witnessed the rise of hashing-based approaches that use XOR-based hashing and employ SAT solvers to solve the resulting CNF formulas conjuncted with XOR constraints. Since over 99% of the runtime of hashing-based techniques is spent inside the SAT queries, improving CNF-XOR solvers has emerged as a key challenge. In this paper, we identify the key performance bottlenecks in the recently proposed
SUBMITTER: Lahiri S
PROVIDER: S-EPMC7363182 | biostudies-literature | 2020 Jun
REPOSITORIES: biostudies-literature
ACCESS DATA